________________________________________________________________

Run Header: Complete YList Version try 5: /small pw steps

Run start:        05.02.2010 00:39:56
Input Data from:  dataset226.txt
Iteration limit:  500
NI iter. limit:   200

# of Customers  :200
# of Locations  :40
Ex.Facilities   :2
Total budget    :25000
Terror. attacks :3

Penalty Weight : 0,5
Update Policy  : 4-3 of last 10
pw inc. step   : 0,005

Coverage Ratio :0,165875
Average f[i]   :5212,5
Average g[i,j] :1998,68421052632
Total demand   :10550
________________________________________________________________

## ITERATION 0 #######################


> Neighbours evaluated; 39
> Selected Move:	0	1	-1	2	5000


> New Y[]: 
	
	 2  3  1  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0 


> New S[]: 
	
	 1  1  1  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0 
 > pw :0,5

## ITERATION 1 #######################


> Neighbours evaluated; 38
> Selected Move:	1780	1	-1	3	10500


> New Y[]: 
	
	 2  3  1  1  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0    >new incumb.: 1780


> New S[]: 
	
	 1  1  0  1  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0 
 > pw :0,5

## ITERATION 2 #######################


> Neighbours evaluated; 181
> Selected Move:	3430	1	-1	33	17000


> New Y[]: 
	
	 2  3  1  1  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  1  0  0  0  0  0  0    >new incumb.: 3430


> New S[]: 
	
	 1  1  0  1  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0 
 > pw :0,5

## ITERATION 3 #######################


> Neighbours evaluated; 126
> Selected Move:	4450	1	-1	25	21500


> New Y[]: 
	
	 2  3  1  1  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  1  0  0  0  0  0  0  0  1  0  0  0  0  0  0    >new incumb.: 4450


> New S[]: 
	
	 1  1  0  1  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0 
 > pw :0,5

## ITERATION 4 #######################


> Neighbours evaluated; 247
> Selected Move:	5190	1	-1	6	25500


> New Y[]: 
	
	 2  3  1  1  0  0  1  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  1  0  0  0  0  0  0  0  1  0  0  0  0  0  0 


> New S[]: 
	
	 0  0  1  1  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  1  0  0  0  0  0  0 
 > pw :0,5

## ITERATION 5 #######################


> Neighbours evaluated; 209
> Selected Move:	5440	3	2	13	24500


> New Y[]: 
	
	 2  3  0  1  0  0  1  0  0  0  0  0  0  1  0  0  0  0  0  0  0  0  0  0  0  1  0  0  0  0  0  0  0  1  0  0  0  0  0  0    >new incumb.: 5440


> New S[]: 
	
	 0  0  0  1  0  0  0  0  0  0  0  0  0  1  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  1  0  0  0  0  0  0 
 > pw :0,5

## ITERATION 6 #######################


> Neighbours evaluated; 180
> Selected Move:	5570	3	6	39	25000


> New Y[]: 
	
	 2  3  0  1  0  0  0  0  0  0  0  0  0  1  0  0  0  0  0  0  0  0  0  0  0  1  0  0  0  0  0  0  0  1  0  0  0  0  0  1    >new incumb.: 5570


> New S[]: 
	
	 0  0  0  1  0  0  0  0  0  0  0  0  0  1  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  1  0  0  0  0  0  0 
 > pw :0,495

## ITERATION 7 #######################


> Neighbours evaluated; 215
> Selected Move:	5570	3	3	15	25000


> New Y[]: 
	
	 2  3  0  0  0  0  0  0  0  0  0  0  0  1  0  1  0  0  0  0  0  0  0  0  0  1  0  0  0  0  0  0  0  1  0  0  0  0  0  1 


> New S[]: 
	
	 0  0  0  0  0  0  0  0  0  0  0  0  0  1  0  1  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  1  0  0  0  0  0  0 
 > pw :0,49

## ITERATION 8 #######################


> Neighbours evaluated; 233
> Selected Move:	5480	3	25	28	25000


> New Y[]: 
	
	 2  3  0  0  0  0  0  0  0  0  0  0  0  1  0  1  0  0  0  0  0  0  0  0  0  0  0  0  1  0  0  0  0  1  0  0  0  0  0  1 


> New S[]: 
	
	 1  1  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  1 
 > pw :0,485

## ITERATION 9 #######################


> Neighbours evaluated; 229
> Selected Move:	5540	3	15	3	25000


> New Y[]: 
	
	 2  3  0  1  0  0  0  0  0  0  0  0  0  1  0  0  0  0  0  0  0  0  0  0  0  0  0  0  1  0  0  0  0  1  0  0  0  0  0  1 


> New S[]: 
	
	 1  1  0  1  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0 
 > pw :0,48

## ITERATION 10 #######################


> Neighbours evaluated; 235
> Selected Move:	5390	3	39	6	24500


> New Y[]: 
	
	 2  3  0  1  0  0  1  0  0  0  0  0  0  1  0  0  0  0  0  0  0  0  0  0  0  0  0  0  1  0  0  0  0  1  0  0  0  0  0  0 


> New S[]: 
	
	 1  1  0  1  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0 
 > pw :0,475

## ITERATION 11 #######################


> Neighbours evaluated; 196
> Selected Move:	5430	3	13	25	25000


> New Y[]: 
	
	 2  3  0  1  0  0  1  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  1  0  0  1  0  0  0  0  1  0  0  0  0  0  0 


> New S[]: 
	
	 1  1  0  1  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0 
 > pw :0,47

## ITERATION 12 #######################


> Neighbours evaluated; 175
> Selected Move:	5430	3	3	15	25000


> New Y[]: 
	
	 2  3  0  0  0  0  1  0  0  0  0  0  0  0  0  1  0  0  0  0  0  0  0  0  0  1  0  0  1  0  0  0  0  1  0  0  0  0  0  0 


> New S[]: 
	
	 1  1  0  0  0  0  0  0  0  0  0  0  0  0  0  1  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0 
 > pw :0,465

## ITERATION 13 #######################


> Neighbours evaluated; 159
> Selected Move:	5440	3	28	13	24500


> New Y[]: 
	
	 2  3  0  0  0  0  1  0  0  0  0  0  0  1  0  1  0  0  0  0  0  0  0  0  0  1  0  0  0  0  0  0  0  1  0  0  0  0  0  0 


> New S[]: 
	
	 0  0  0  0  0  0  0  0  0  0  0  0  0  1  0  1  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  1  0  0  0  0  0  0 
 > pw :0,46

## ITERATION 14 #######################


> Neighbours evaluated; 198
> Selected Move:	5390	3	25	28	24500


> New Y[]: 
	
	 2  3  0  0  0  0  1  0  0  0  0  0  0  1  0  1  0  0  0  0  0  0  0  0  0  0  0  0  1  0  0  0  0  1  0  0  0  0  0  0 


> New S[]: 
	
	 1  1  0  0  0  0  0  0  0  0  0  0  0  0  0  1  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0 
 > pw :0,455

## ITERATION 15 #######################


> Neighbours evaluated; 189
> Selected Move:	5370	3	6	4	24500


> New Y[]: 
	
	 2  3  0  0  1  0  0  0  0  0  0  0  0  1  0  1  0  0  0  0  0  0  0  0  0  0  0  0  1  0  0  0  0  1  0  0  0  0  0  0 


> New S[]: 
	
	 0  0  0  0  0  0  0  0  0  0  0  0  0  1  0  1  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  1  0  0  0  0  0  0 
 > pw :0,45

## ITERATION 16 #######################


> Neighbours evaluated; 175
> Selected Move:	5370	3	15	3	24500


> New Y[]: 
	
	 2  3  0  1  1  0  0  0  0  0  0  0  0  1  0  0  0  0  0  0  0  0  0  0  0  0  0  0  1  0  0  0  0  1  0  0  0  0  0  0 


> New S[]: 
	
	 0  0  0  1  0  0  0  0  0  0  0  0  0  1  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  1  0  0  0  0  0  0 
 > pw :0,445

## ITERATION 17 #######################


> Neighbours evaluated; 176
> Selected Move:	5370	3	13	21	25000


> New Y[]: 
	
	 2  3  0  1  1  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  1  0  0  0  0  0  0  1  0  0  0  0  1  0  0  0  0  0  0 


> New S[]: 
	
	 0  0  0  1  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  1  0  0  0  0  0  0  0  0  0  0  0  1  0  0  0  0  0  0 
 > pw :0,44

## ITERATION 18 #######################


> Neighbours evaluated; 169
> Selected Move:	5280	3	33	17	24500


> New Y[]: 
	
	 2  3  0  1  1  0  0  0  0  0  0  0  0  0  0  0  0  1  0  0  0  1  0  0  0  0  0  0  1  0  0  0  0  0  0  0  0  0  0  0 


> New S[]: 
	
	 1  1  0  0  1  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0 
 > pw :0,435

## ITERATION 19 #######################


> Neighbours evaluated; 183
> Selected Move:	5280	3	4	6	24500


> New Y[]: 
	
	 2  3  0  1  0  0  1  0  0  0  0  0  0  0  0  0  0  1  0  0  0  1  0  0  0  0  0  0  1  0  0  0  0  0  0  0  0  0  0  0 


> New S[]: 
	
	 1  1  0  0  0  0  1  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0 
 > pw :0,43

## ITERATION 20 #######################


> Neighbours evaluated; 200
> Selected Move:	5480	3	17	36	25000


> New Y[]: 
	
	 2  3  0  1  0  0  1  0  0  0  0  0  0  0  0  0  0  0  0  0  0  1  0  0  0  0  0  0  1  0  0  0  0  0  0  0  1  0  0  0 


> New S[]: 
	
	 0  0  0  1  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  1  0  0  0  0  0  0  1  0  0  0  0  0  0  0  0  0  0  0 
 > pw :0,425

## ITERATION 21 #######################


> Neighbours evaluated; 194
> Selected Move:	5360	3	36	14	24000


> New Y[]: 
	
	 2  3  0  1  0  0  1  0  0  0  0  0  0  0  1  0  0  0  0  0  0  1  0  0  0  0  0  0  1  0  0  0  0  0  0  0  0  0  0  0 


> New S[]: 
	
	 0  0  0  1  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  1  0  0  0  0  0  0  1  0  0  0  0  0  0  0  0  0  0  0 
 > pw :0,42

## ITERATION 22 #######################


> Neighbours evaluated; 222
> Selected Move:	5450	3	6	39	24500


> New Y[]: 
	
	 2  3  0  1  0  0  0  0  0  0  0  0  0  0  1  0  0  0  0  0  0  1  0  0  0  0  0  0  1  0  0  0  0  0  0  0  0  0  0  1 


> New S[]: 
	
	 1  1  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  1 
 > pw :0,415

## ITERATION 23 #######################


> Neighbours evaluated; 249
> Selected Move:	5430	3	28	13	24000


> New Y[]: 
	
	 2  3  0  1  0  0  0  0  0  0  0  0  0  1  1  0  0  0  0  0  0  1  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  1 


> New S[]: 
	
	 1  1  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  1 
 > pw :0,41

## ITERATION 24 #######################


> Neighbours evaluated; 266
> Selected Move:	5440	3	14	25	23000


> New Y[]: 
	
	 2  3  0  1  0  0  0  0  0  0  0  0  0  1  0  0  0  0  0  0  0  1  0  0  0  1  0  0  0  0  0  0  0  0  0  0  0  0  0  1 


> New S[]: 
	
	 1  1  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  1  0  0  0  0  0  0  0  0  0  0  0  0  0  0 
 > pw :0,405

## ITERATION 25 #######################


> Neighbours evaluated; 245
> Selected Move:	5540	3	13	17	25000


> New Y[]: 
	
	 2  3  0  1  0  0  0  0  0  0  0  0  0  0  0  0  0  1  0  0  0  1  0  0  0  1  0  0  0  0  0  0  0  0  0  0  0  0  0  1 


> New S[]: 
	
	 1  1  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  1 
 > pw :0,4

## ITERATION 26 #######################


> Neighbours evaluated; 219
> Selected Move:	5510	3	17	2	24000


> New Y[]: 
	
	 2  3  1  1  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  1  0  0  0  1  0  0  0  0  0  0  0  0  0  0  0  0  0  1 


> New S[]: 
	
	 1  1  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  1 
 > pw :0,395

## ITERATION 27 #######################


> Neighbours evaluated; 252
> Selected Move:	5510	3	2	11	24500


> New Y[]: 
	
	 2  3  0  1  0  0  0  0  0  0  0  1  0  0  0  0  0  0  0  0  0  1  0  0  0  1  0  0  0  0  0  0  0  0  0  0  0  0  0  1 


> New S[]: 
	
	 1  1  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  1 
 > pw :0,39

## ITERATION 28 #######################


> Neighbours evaluated; 240
> Selected Move:	5500	3	11	34	25000


> New Y[]: 
	
	 2  3  0  1  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  1  0  0  0  1  0  0  0  0  0  0  0  0  1  0  0  0  0  1 


> New S[]: 
	
	 1  1  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  1  0  0  0  0  0  0  0  0  0  0  0  0  0  0 
 > pw :0,385

## ITERATION 29 #######################


> Neighbours evaluated; 227
> Selected Move:	5460	3	34	18	24500


> New Y[]: 
	
	 2  3  0  1  0  0  0  0  0  0  0  0  0  0  0  0  0  0  1  0  0  1  0  0  0  1  0  0  0  0  0  0  0  0  0  0  0  0  0  1 


> New S[]: 
	
	 1  1  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  1 
 > pw :0,38

## ITERATION 30 #######################


> Neighbours evaluated; 240
> Selected Move:	5440	3	39	6	24000


> New Y[]: 
	
	 2  3  0  1  0  0  1  0  0  0  0  0  0  0  0  0  0  0  1  0  0  1  0  0  0  1  0  0  0  0  0  0  0  0  0  0  0  0  0  0 


> New S[]: 
	
	 0  0  0  1  0  0  0  0  0  0  0  0  0  0  0  0  0  0  1  0  0  1  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0 
 > pw :0,375

## ITERATION 31 #######################


> Neighbours evaluated; 225
> Selected Move:	5440	3	18	2	23500


> New Y[]: 
	
	 2  3  1  1  0  0  1  0  0  0  0  0  0  0  0  0  0  0  0  0  0  1  0  0  0  1  0  0  0  0  0  0  0  0  0  0  0  0  0  0 


> New S[]: 
	
	 0  0  1  1  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  1  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0 
 > pw :0,37

## ITERATION 32 #######################


> Neighbours evaluated; 271
> Selected Move:	5440	3	2	11	24000


> New Y[]: 
	
	 2  3  0  1  0  0  1  0  0  0  0  1  0  0  0  0  0  0  0  0  0  1  0  0  0  1  0  0  0  0  0  0  0  0  0  0  0  0  0  0 


> New S[]: 
	
	 0  0  0  1  0  0  0  0  0  0  0  1  0  0  0  0  0  0  0  0  0  1  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0 
 > pw :0,365

## ITERATION 33 #######################


> Neighbours evaluated; 232
> Selected Move:	5440	3	11	17	24500


> New Y[]: 
	
	 2  3  0  1  0  0  1  0  0  0  0  0  0  0  0  0  0  1  0  0  0  1  0  0  0  1  0  0  0  0  0  0  0  0  0  0  0  0  0  0 


> New S[]: 
	
	 0  0  0  1  0  0  0  0  0  0  0  0  0  0  0  0  0  1  0  0  0  1  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0 
 > pw :0,36

## ITERATION 34 #######################


> Neighbours evaluated; 202
> Selected Move:	5440	3	17	22	25000


> New Y[]: 
	
	 2  3  0  1  0  0  1  0  0  0  0  0  0  0  0  0  0  0  0  0  0  1  1  0  0  1  0  0  0  0  0  0  0  0  0  0  0  0  0  0 


> New S[]: 
	
	 0  0  0  1  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  1  1  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0 
 > pw :0,355

## ITERATION 35 #######################


> Neighbours evaluated; 194
> Selected Move:	5440	3	22	30	25000


> New Y[]: 
	
	 2  3  0  1  0  0  1  0  0  0  0  0  0  0  0  0  0  0  0  0  0  1  0  0  0  1  0  0  0  0  1  0  0  0  0  0  0  0  0  0 


> New S[]: 
	
	 0  0  0  1  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  1  0  0  0  0  0  0  0  0  1  0  0  0  0  0  0  0  0  0 
 > pw :0,35

## ITERATION 36 #######################


> Neighbours evaluated; 197
> Selected Move:	5400	3	30	5	25000


> New Y[]: 
	
	 2  3  0  1  0  1  1  0  0  0  0  0  0  0  0  0  0  0  0  0  0  1  0  0  0  1  0  0  0  0  0  0  0  0  0  0  0  0  0  0 


> New S[]: 
	
	 0  0  0  1  0  0  1  0  0  0  0  0  0  0  0  0  0  0  0  0  0  1  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0 
 > pw :0,345

## ITERATION 37 #######################


> Neighbours evaluated; 254
> Selected Move:	5370	3	5	34	24500


> New Y[]: 
	
	 2  3  0  1  0  0  1  0  0  0  0  0  0  0  0  0  0  0  0  0  0  1  0  0  0  1  0  0  0  0  0  0  0  0  1  0  0  0  0  0 


> New S[]: 
	
	 1  1  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  1  0  0  0  0  0  0  0  0  0  0  0  0  0  0 
 > pw :0,34

## ITERATION 38 #######################


> Neighbours evaluated; 226
> Selected Move:	5360	3	34	23	25000


> New Y[]: 
	
	 2  3  0  1  0  0  1  0  0  0  0  0  0  0  0  0  0  0  0  0  0  1  0  1  0  1  0  0  0  0  0  0  0  0  0  0  0  0  0  0 


> New S[]: 
	
	 1  1  0  0  0  0  1  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0 
 > pw :0,335

## ITERATION 39 #######################


> Neighbours evaluated; 204
> Selected Move:	5360	3	23	28	23000


> New Y[]: 
	
	 2  3  0  1  0  0  1  0  0  0  0  0  0  0  0  0  0  0  0  0  0  1  0  0  0  1  0  0  1  0  0  0  0  0  0  0  0  0  0  0 


> New S[]: 
	
	 1  1  0  0  0  0  1  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0 
 > pw :0,33

## ITERATION 40 #######################


> Neighbours evaluated; 238
> Selected Move:	5360	3	6	24	25000


> New Y[]: 
	
	 2  3  0  1  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  1  0  0  1  1  0  0  1  0  0  0  0  0  0  0  0  0  0  0 


> New S[]: 
	
	 1  1  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  1  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0 
 > pw :0,325

## ITERATION 41 #######################


> Neighbours evaluated; 228
> Selected Move:	5390	3	28	13	24500


> New Y[]: 
	
	 2  3  0  1  0  0  0  0  0  0  0  0  0  1  0  0  0  0  0  0  0  1  0  0  1  1  0  0  0  0  0  0  0  0  0  0  0  0  0  0 


> New S[]: 
	
	 0  0  0  1  0  0  0  0  0  0  0  0  0  1  0  0  0  0  0  0  0  1  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0 
 > pw :0,32

## ITERATION 42 #######################


> Neighbours evaluated; 251
> Selected Move:	5390	3	24	31	24500


> New Y[]: 
	
	 2  3  0  1  0  0  0  0  0  0  0  0  0  1  0  0  0  0  0  0  0  1  0  0  0  1  0  0  0  0  0  1  0  0  0  0  0  0  0  0 


> New S[]: 
	
	 0  0  0  1  0  0  0  0  0  0  0  0  0  1  0  0  0  0  0  0  0  1  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0 
 > pw :0,315

## ITERATION 43 #######################


> Neighbours evaluated; 252
> Selected Move:	5380	3	21	2	25000


> New Y[]: 
	
	 2  3  1  1  0  0  0  0  0  0  0  0  0  1  0  0  0  0  0  0  0  0  0  0  0  1  0  0  0  0  0  1  0  0  0  0  0  0  0  0 


> New S[]: 
	
	 1  1  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  1  0  0  0  0  0  0  0  0 
 > pw :0,31

## ITERATION 44 #######################


> Neighbours evaluated; 262
> Selected Move:	5380	3	2	28	24500


> New Y[]: 
	
	 2  3  0  1  0  0  0  0  0  0  0  0  0  1  0  0  0  0  0  0  0  0  0  0  0  1  0  0  1  0  0  1  0  0  0  0  0  0  0  0 


> New S[]: 
	
	 1  1  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  1  0  0  0  0  0  0  0  0 
 > pw :0,305

## ITERATION 45 #######################


> Neighbours evaluated; 260
> Selected Move:	5380	3	31	7	25000


> New Y[]: 
	
	 2  3  0  1  0  0  0  1  0  0  0  0  0  1  0  0  0  0  0  0  0  0  0  0  0  1  0  0  1  0  0  0  0  0  0  0  0  0  0  0 


> New S[]: 
	
	 1  1  0  0  0  0  0  1  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0 
 > pw :0,3

## ITERATION 46 #######################


> Neighbours evaluated; 150
> Selected Move:	5480	3	13	32	25000


> New Y[]: 
	
	 2  3  0  1  0  0  0  1  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  1  0  0  1  0  0  0  1  0  0  0  0  0  0  0 


> New S[]: 
	
	 0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  1  0  0  1  0  0  0  1  0  0  0  0  0  0  0 
 > pw :0,295

## ITERATION 47 #######################


> Neighbours evaluated; 143
> Selected Move:	5480	3	25	13	24500


> New Y[]: 
	
	 2  3  0  1  0  0  0  1  0  0  0  0  0  1  0  0  0  0  0  0  0  0  0  0  0  0  0  0  1  0  0  0  1  0  0  0  0  0  0  0 


> New S[]: 
	
	 0  0  0  0  0  0  0  0  0  0  0  0  0  1  0  0  0  0  0  0  0  0  0  0  0  0  0  0  1  0  0  0  1  0  0  0  0  0  0  0 
 > pw :0,29

## ITERATION 48 #######################


> Neighbours evaluated; 169
> Selected Move:	5480	3	28	25	24500


> New Y[]: 
	
	 2  3  0  1  0  0  0  1  0  0  0  0  0  1  0  0  0  0  0  0  0  0  0  0  0  1  0  0  0  0  0  0  1  0  0  0  0  0  0  0 


> New S[]: 
	
	 0  0  0  0  0  0  0  0  0  0  0  0  0  1  0  0  0  0  0  0  0  0  0  0  0  1  0  0  0  0  0  0  1  0  0  0  0  0  0  0 
 > pw :0,285

## ITERATION 49 #######################


> Neighbours evaluated; 184
> Selected Move:	5380	3	3	15	24500


> New Y[]: 
	
	 2  3  0  0  0  0  0  1  0  0  0  0  0  1  0  1  0  0  0  0  0  0  0  0  0  1  0  0  0  0  0  0  1  0  0  0  0  0  0  0 


> New S[]: 
	
	 1  1  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  1  0  0  0  0  0  0  0  0  0  0  0  0  0  0 
 > pw :0,28

## ITERATION 50 #######################


> Neighbours evaluated; 223
> Selected Move:	5470	3	13	28	25000


> New Y[]: 
	
	 2  3  0  0  0  0  0  1  0  0  0  0  0  0  0  1  0  0  0  0  0  0  0  0  0  1  0  0  1  0  0  0  1  0  0  0  0  0  0  0 


> New S[]: 
	
	 0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  1  0  0  1  0  0  0  1  0  0  0  0  0  0  0 
 > pw :0,275

## ITERATION 51 #######################


> Neighbours evaluated; 162
> Selected Move:	5333	3	28	2	25500


> New Y[]: 
	
	 2  3  1  0  0  0  0  1  0  0  0  0  0  0  0  1  0  0  0  0  0  0  0  0  0  1  0  0  0  0  0  0  1  0  0  0  0  0  0  0 


> New S[]: 
	
	 0  0  1  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  1  0  0  0  0  0  0  1  0  0  0  0  0  0  0 
 > pw :0,27

## ITERATION 52 #######################


> Neighbours evaluated; 242
> Selected Move:	5345	3	15	3	25500


> New Y[]: 
	
	 2  3  1  1  0  0  0  1  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  1  0  0  0  0  0  0  1  0  0  0  0  0  0  0 


> New S[]: 
	
	 0  0  1  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  1  0  0  0  0  0  0  1  0  0  0  0  0  0  0 
 > pw :0,265

## ITERATION 53 #######################


> Neighbours evaluated; 250
> Selected Move:	5348	3	25	28	25500


> New Y[]: 
	
	 2  3  1  1  0  0  0  1  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  1  0  0  0  1  0  0  0  0  0  0  0 


> New S[]: 
	
	 0  0  0  1  0  0  0  1  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  1  0  0  0  0  0  0  0 
 > pw :0,26

## ITERATION 54 #######################


> Neighbours evaluated; 255
> Selected Move:	5240	3	7	24	25000


> New Y[]: 
	
	 2  3  1  1  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  1  0  0  0  1  0  0  0  1  0  0  0  0  0  0  0 


> New S[]: 
	
	 0  0  1  1  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  1  0  0  0  0  0  0  0  0  0  0  0 
 > pw :0,255

## ITERATION 55 #######################


> Neighbours evaluated; 271
> Selected Move:	5240	3	2	13	24000


> New Y[]: 
	
	 2  3  0  1  0  0  0  0  0  0  0  0  0  1  0  0  0  0  0  0  0  0  0  0  1  0  0  0  1  0  0  0  1  0  0  0  0  0  0  0 


> New S[]: 
	
	 0  0  0  1  0  0  0  0  0  0  0  0  0  1  0  0  0  0  0  0  0  0  0  0  0  0  0  0  1  0  0  0  0  0  0  0  0  0  0  0 
 > pw :0,25

## ITERATION 56 #######################


> Neighbours evaluated; 269
> Selected Move:	5380	3	32	25	24500


> New Y[]: 
	
	 2  3  0  1  0  0  0  0  0  0  0  0  0  1  0  0  0  0  0  0  0  0  0  0  1  1  0  0  1  0  0  0  0  0  0  0  0  0  0  0 


> New S[]: 
	
	 1  1  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  1  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0 
 > pw :0,245

## ITERATION 57 #######################


> Neighbours evaluated; 262
> Selected Move:	5380	3	28	2	25000


> New Y[]: 
	
	 2  3  1  1  0  0  0  0  0  0  0  0  0  1  0  0  0  0  0  0  0  0  0  0  1  1  0  0  0  0  0  0  0  0  0  0  0  0  0  0 


> New S[]: 
	
	 1  1  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  1  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0 
 > pw :0,24

## ITERATION 58 #######################


> Neighbours evaluated; 273
> Selected Move:	5270	3	13	21	25500


> New Y[]: 
	
	 2  3  1  1  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  1  0  0  1  1  0  0  0  0  0  0  0  0  0  0  0  0  0  0 


> New S[]: 
	
	 0  0  1  1  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  1  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0 
 > pw :0,235

## ITERATION 59 #######################


> Neighbours evaluated; 267
> Selected Move:	5273	3	24	31	25500


> New Y[]: 
	
	 2  3  1  1  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  1  0  0  0  1  0  0  0  0  0  1  0  0  0  0  0  0  0  0 


> New S[]: 
	
	 0  0  1  1  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  1  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0 
 > pw :0,24

## ITERATION 60 #######################


> Neighbours evaluated; 265
> Selected Move:	5360	3	2	28	25000


> New Y[]: 
	
	 2  3  0  1  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  1  0  0  0  1  0  0  1  0  0  1  0  0  0  0  0  0  0  0 


> New S[]: 
	
	 1  1  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  1  0  0  0  0  0  0  0  0 
 > pw :0,245

## ITERATION 61 #######################


> Neighbours evaluated; 254
> Selected Move:	5360	3	31	39	23500


> New Y[]: 
	
	 2  3  0  1  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  1  0  0  0  1  0  0  1  0  0  0  0  0  0  0  0  0  0  1 


> New S[]: 
	
	 1  1  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  1 
 > pw :0,24

## ITERATION 62 #######################


> Neighbours evaluated; 253
> Selected Move:	5390	3	25	36	25500


> New Y[]: 
	
	 2  3  0  1  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  1  0  0  0  0  0  0  1  0  0  0  0  0  0  0  1  0  0  1 


> New S[]: 
	
	 1  1  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  1 
 > pw :0,235

## ITERATION 63 #######################


> Neighbours evaluated; 245
> Selected Move:	5440	3	28	13	25000


> New Y[]: 
	
	 2  3  0  1  0  0  0  0  0  0  0  0  0  1  0  0  0  0  0  0  0  1  0  0  0  0  0  0  0  0  0  0  0  0  0  0  1  0  0  1 


> New S[]: 
	
	 1  1  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  1  0  0  0 
 > pw :0,23

## ITERATION 64 #######################


> Neighbours evaluated; 265
> Selected Move:	5370	3	21	32	24500


> New Y[]: 
	
	 2  3  0  1  0  0  0  0  0  0  0  0  0  1  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  1  0  0  0  1  0  0  1 


> New S[]: 
	
	 1  1  0  1  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0 
 > pw :0,225

## ITERATION 65 #######################


> Neighbours evaluated; 267
> Selected Move:	5370	3	3	15	24500


> New Y[]: 
	
	 2  3  0  0  0  0  0  0  0  0  0  0  0  1  0  1  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  1  0  0  0  1  0  0  1 


> New S[]: 
	
	 1  1  0  0  0  0  0  0  0  0  0  0  0  0  0  1  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0 
 > pw :0,22

## ITERATION 66 #######################


> Neighbours evaluated; 274
> Selected Move:	5300	3	36	25	22500


> New Y[]: 
	
	 2  3  0  0  0  0  0  0  0  0  0  0  0  1  0  1  0  0  0  0  0  0  0  0  0  1  0  0  0  0  0  0  1  0  0  0  0  0  0  1 


> New S[]: 
	
	 1  1  0  0  0  0  0  0  0  0  0  0  0  0  0  1  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0 
 > pw :0,215

## ITERATION 67 #######################


> Neighbours evaluated; 275
> Selected Move:	5503	1	-1	35	27500


> New Y[]: 
	
	 2  3  0  0  0  0  0  0  0  0  0  0  0  1  0  1  0  0  0  0  0  0  0  0  0  1  0  0  0  0  0  0  1  0  0  1  0  0  0  1 


> New S[]: 
	
	 1  1  0  0  0  0  0  0  0  0  0  0  0  0  0  1  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0 
 > pw :0,21

## ITERATION 68 #######################


> Neighbours evaluated; 306
> Selected Move:	5515	3	15	3	27500


> New Y[]: 
	
	 2  3  0  1  0  0  0  0  0  0  0  0  0  1  0  0  0  0  0  0  0  0  0  0  0  1  0  0  0  0  0  0  1  0  0  1  0  0  0  1 


> New S[]: 
	
	 1  1  0  1  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0 
 > pw :0,205

## ITERATION 69 #######################


> Neighbours evaluated; 306
> Selected Move:	5480	3	39	6	27000


> New Y[]: 
	
	 2  3  0  1  0  0  1  0  0  0  0  0  0  1  0  0  0  0  0  0  0  0  0  0  0  1  0  0  0  0  0  0  1  0  0  1  0  0  0  0 


> New S[]: 
	
	 1  1  0  1  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0 
 > pw :0,2

## ITERATION 70 #######################


> Neighbours evaluated; 287
> Selected Move:	5490	3	3	15	27000


> New Y[]: 
	
	 2  3  0  0  0  0  1  0  0  0  0  0  0  1  0  1  0  0  0  0  0  0  0  0  0  1  0  0  0  0  0  0  1  0  0  1  0  0  0  0 


> New S[]: 
	
	 1  1  0  0  0  0  0  0  0  0  0  0  0  0  0  1  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0 
 > pw :0,205

## ITERATION 71 #######################


> Neighbours evaluated; 296
> Selected Move:	5453	3	35	39	26500


> New Y[]: 
	
	 2  3  0  0  0  0  1  0  0  0  0  0  0  1  0  1  0  0  0  0  0  0  0  0  0  1  0  0  0  0  0  0  1  0  0  0  0  0  0  1 


> New S[]: 
	
	 0  0  0  0  0  0  0  0  0  0  0  0  0  1  0  1  0  0  0  0  0  0  0  0  0  1  0  0  0  0  0  0  0  0  0  0  0  0  0  0 
 > pw :0,21

## ITERATION 72 #######################


> Neighbours evaluated; 297
> Selected Move:	5445	3	15	3	26500


> New Y[]: 
	
	 2  3  0  1  0  0  1  0  0  0  0  0  0  1  0  0  0  0  0  0  0  0  0  0  0  1  0  0  0  0  0  0  1  0  0  0  0  0  0  1 


> New S[]: 
	
	 0  0  0  1  0  0  0  0  0  0  0  0  0  1  0  0  0  0  0  0  0  0  0  0  0  1  0  0  0  0  0  0  0  0  0  0  0  0  0  0 
 > pw :0,215

## ITERATION 73 #######################


> Neighbours evaluated; 294
> Selected Move:	5480	3	32	21	27000


> New Y[]: 
	
	 2  3  0  1  0  0  1  0  0  0  0  0  0  1  0  0  0  0  0  0  0  1  0  0  0  1  0  0  0  0  0  0  0  0  0  0  0  0  0  1 


> New S[]: 
	
	 0  0  0  1  0  0  0  0  0  0  0  0  0  1  0  0  0  0  0  0  0  1  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0 
 > pw :0,22

## ITERATION 74 #######################


> Neighbours evaluated; 287
> Selected Move:	5630	3	25	28	27000


> New Y[]: 
	
	 2  3  0  1  0  0  1  0  0  0  0  0  0  1  0  0  0  0  0  0  0  1  0  0  0  0  0  0  1  0  0  0  0  0  0  0  0  0  0  1 


> New S[]: 
	
	 1  1  0  1  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0 
 > pw :0,225

## ITERATION 75 #######################


> Neighbours evaluated; 286
> Selected Move:	5520	3	6	4	27000


> New Y[]: 
	
	 2  3  0  1  1  0  0  0  0  0  0  0  0  1  0  0  0  0  0  0  0  1  0  0  0  0  0  0  1  0  0  0  0  0  0  0  0  0  0  1 


> New S[]: 
	
	 0  0  0  1  0  0  0  0  0  0  0  0  0  1  0  0  0  0  0  0  0  1  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0 
 > pw :0,23

## ITERATION 76 #######################


> Neighbours evaluated; 251
> Selected Move:	5510	3	3	15	27000


> New Y[]: 
	
	 2  3  0  0  1  0  0  0  0  0  0  0  0  1  0  1  0  0  0  0  0  1  0  0  0  0  0  0  1  0  0  0  0  0  0  0  0  0  0  1 


> New S[]: 
	
	 0  0  0  0  0  0  0  0  0  0  0  0  0  1  0  0  0  0  0  0  0  1  0  0  0  0  0  0  1  0  0  0  0  0  0  0  0  0  0  0 
 > pw :0,235

## ITERATION 77 #######################


> Neighbours evaluated; 252
> Selected Move:	5493	3	15	32	25500


> New Y[]: 
	
	 2  3  0  0  1  0  0  0  0  0  0  0  0  1  0  0  0  0  0  0  0  1  0  0  0  0  0  0  1  0  0  0  1  0  0  0  0  0  0  1 


> New S[]: 
	
	 0  0  0  0  0  0  0  0  0  0  0  0  0  1  0  0  0  0  0  0  0  1  0  0  0  0  0  0  1  0  0  0  0  0  0  0  0  0  0  0 
 > pw :0,24

## ITERATION 78 #######################


> Neighbours evaluated; 272
> Selected Move:	5490	3	28	25	25500


> New Y[]: 
	
	 2  3  0  0  1  0  0  0  0  0  0  0  0  1  0  0  0  0  0  0  0  1  0  0  0  1  0  0  0  0  0  0  1  0  0  0  0  0  0  1 


> New S[]: 
	
	 0  0  0  0  0  0  0  0  0  0  0  0  0  1  0  0  0  0  0  0  0  1  0  0  0  1  0  0  0  0  0  0  0  0  0  0  0  0  0  0 
 > pw :0,245

## ITERATION 79 #######################


> Neighbours evaluated; 276
> Selected Move:	5445	3	32	28	26000


> New Y[]: 
	
	 2  3  0  0  1  0  0  0  0  0  0  0  0  1  0  0  0  0  0  0  0  1  0  0  0  1  0  0  1  0  0  0  0  0  0  0  0  0  0  1 


> New S[]: 
	
	 0  0  0  0  0  0  0  0  0  0  0  0  0  1  0  0  0  0  0  0  0  1  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  1 
 > pw :0,25

## ITERATION 80 #######################


> Neighbours evaluated; 263
> Selected Move:	5385	3	28	2	26500


> New Y[]: 
	
	 2  3  1  0  1  0  0  0  0  0  0  0  0  1  0  0  0  0  0  0  0  1  0  0  0  1  0  0  0  0  0  0  0  0  0  0  0  0  0  1 


> New S[]: 
	
	 0  0  1  0  0  0  0  0  0  0  0  0  0  1  0  0  0  0  0  0  0  1  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0 
 > pw :0,255

## ITERATION 81 #######################


> Neighbours evaluated; 250
> Selected Move:	5263	3	25	3	27500


> New Y[]: 
	
	 2  3  1  1  1  0  0  0  0  0  0  0  0  1  0  0  0  0  0  0  0  1  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  1 


> New S[]: 
	
	 1  1  0  0  1  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0 
 > pw :0,26

## ITERATION 82 #######################


> Neighbours evaluated; 291
> Selected Move:	5240	3	2	25	27000


> New Y[]: 
	
	 2  3  0  1  1  0  0  0  0  0  0  0  0  1  0  0  0  0  0  0  0  1  0  0  0  1  0  0  0  0  0  0  0  0  0  0  0  0  0  1 


> New S[]: 
	
	 0  0  0  1  0  0  0  0  0  0  0  0  0  1  0  0  0  0  0  0  0  1  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0 
 > pw :0,265

## ITERATION 83 #######################


> Neighbours evaluated; 242
> Selected Move:	5440	4	0	3	24000


> New Y[]: 
	
	 0  3  0  2  1  0  0  0  0  0  0  0  0  1  0  0  0  0  0  0  0  1  0  0  0  1  0  0  0  0  0  0  0  0  0  0  0  0  0  1 


> New S[]: 
	
	 0  1  0  0  1  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  1  0  0  0  0  0  0  0  0  0  0  0  0  0  0 
 > pw :0,27

## ITERATION 84 #######################


> Neighbours evaluated; 229
> Selected Move:	5440	4	3	21	24800


> New Y[]: 
	
	 0  3  0  1  1  0  0  0  0  0  0  0  0  1  0  0  0  0  0  0  0  2  0  0  0  1  0  0  0  0  0  0  0  0  0  0  0  0  0  1 


> New S[]: 
	
	 0  1  0  0  1  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  1  0  0  0  0  0  0  0  0  0  0  0  0  0  0 
 > pw :0,275

## ITERATION 85 #######################


> Neighbours evaluated; 189
> Selected Move:	5680	3	21	33	24400


> New Y[]: 
	
	 0  3  0  1  1  0  0  0  0  0  0  0  0  1  0  0  0  0  0  0  0  0  0  0  0  1  0  0  0  0  0  0  0  2  0  0  0  0  0  1    >new incumb.: 5680


> New S[]: 
	
	 0  0  0  1  0  0  0  0  0  0  0  0  0  1  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  1  0  0  0  0  0  0 
 > pw :0,28

## ITERATION 86 #######################


> Neighbours evaluated; 225
> Selected Move:	5680	3	3	15	24400


> New Y[]: 
	
	 0  3  0  0  1  0  0  0  0  0  0  0  0  1  0  1  0  0  0  0  0  0  0  0  0  1  0  0  0  0  0  0  0  2  0  0  0  0  0  1 


> New S[]: 
	
	 0  0  0  0  0  0  0  0  0  0  0  0  0  1  0  1  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  1  0  0  0  0  0  0 
 > pw :0,285

## ITERATION 87 #######################


> Neighbours evaluated; 221
> Selected Move:	5538	4	33	15	25500


> New Y[]: 
	
	 0  3  0  0  1  0  0  0  0  0  0  0  0  1  0  2  0  0  0  0  0  0  0  0  0  1  0  0  0  0  0  0  0  1  0  0  0  0  0  1 


> New S[]: 
	
	 0  0  0  0  0  0  0  0  0  0  0  0  0  1  0  1  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  1  0  0  0  0  0  0 
 > pw :0,29

## ITERATION 88 #######################


> Neighbours evaluated; 208
> Selected Move:	5390	3	15	3	26000


> New Y[]: 
	
	 0  3  0  2  1  0  0  0  0  0  0  0  0  1  0  0  0  0  0  0  0  0  0  0  0  1  0  0  0  0  0  0  0  1  0  0  0  0  0  1 


> New S[]: 
	
	 0  0  0  1  0  0  0  0  0  0  0  0  0  1  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  1  0  0  0  0  0  0 
 > pw :0,295

## ITERATION 89 #######################


> Neighbours evaluated; 211
> Selected Move:	5370	3	33	9	25000


> New Y[]: 
	
	 0  3  0  2  1  0  0  0  0  1  0  0  0  1  0  0  0  0  0  0  0  0  0  0  0  1  0  0  0  0  0  0  0  0  0  0  0  0  0  1 


> New S[]: 
	
	 0  1  0  1  1  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0 
 > pw :0,3

## ITERATION 90 #######################


> Neighbours evaluated; 232
> Selected Move:	5370	4	3	9	24800


> New Y[]: 
	
	 0  3  0  1  1  0  0  0  0  2  0  0  0  1  0  0  0  0  0  0  0  0  0  0  0  1  0  0  0  0  0  0  0  0  0  0  0  0  0  1 


> New S[]: 
	
	 0  1  0  1  1  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0 
 > pw :0,295

## ITERATION 91 #######################


> Neighbours evaluated; 240
> Selected Move:	5370	3	3	15	24800


> New Y[]: 
	
	 0  3  0  0  1  0  0  0  0  2  0  0  0  1  0  1  0  0  0  0  0  0  0  0  0  1  0  0  0  0  0  0  0  0  0  0  0  0  0  1 


> New S[]: 
	
	 0  1  0  0  1  0  0  0  0  0  0  0  0  0  0  1  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0 
 > pw :0,29

## ITERATION 92 #######################


> Neighbours evaluated; 162
> Selected Move:	5370	4	9	15	24500


> New Y[]: 
	
	 0  3  0  0  1  0  0  0  0  1  0  0  0  1  0  2  0  0  0  0  0  0  0  0  0  1  0  0  0  0  0  0  0  0  0  0  0  0  0  1 


> New S[]: 
	
	 0  1  0  0  1  0  0  0  0  0  0  0  0  0  0  1  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0 
 > pw :0,285

## ITERATION 93 #######################


> Neighbours evaluated; 215
> Selected Move:	5300	3	9	32	23000


> New Y[]: 
	
	 0  3  0  0  1  0  0  0  0  0  0  0  0  1  0  2  0  0  0  0  0  0  0  0  0  1  0  0  0  0  0  0  1  0  0  0  0  0  0  1 


> New S[]: 
	
	 0  1  0  0  1  0  0  0  0  0  0  0  0  0  0  1  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0 
 > pw :0,28

## ITERATION 94 #######################


> Neighbours evaluated; 242
> Selected Move:	5500	3	13	17	25000


> New Y[]: 
	
	 0  3  0  0  1  0  0  0  0  0  0  0  0  0  0  2  0  1  0  0  0  0  0  0  0  1  0  0  0  0  0  0  1  0  0  0  0  0  0  1 


> New S[]: 
	
	 0  1  0  0  1  0  0  0  0  0  0  0  0  0  0  1  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0 
 > pw :0,275

## ITERATION 95 #######################


> Neighbours evaluated; 196
> Selected Move:	5500	4	15	17	24200


> New Y[]: 
	
	 0  3  0  0  1  0  0  0  0  0  0  0  0  0  0  1  0  2  0  0  0  0  0  0  0  1  0  0  0  0  0  0  1  0  0  0  0  0  0  1 


> New S[]: 
	
	 0  1  0  0  1  0  0  0  0  0  0  0  0  0  0  1  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0 
 > pw :0,27

## ITERATION 96 #######################


> Neighbours evaluated; 220
> Selected Move:	5500	3	15	3	24200


> New Y[]: 
	
	 0  3  0  1  1  0  0  0  0  0  0  0  0  0  0  0  0  2  0  0  0  0  0  0  0  1  0  0  0  0  0  0  1  0  0  0  0  0  0  1 


> New S[]: 
	
	 0  1  0  1  1  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0 
 > pw :0,265

## ITERATION 97 #######################


> Neighbours evaluated; 232
> Selected Move:	5540	3	32	21	24700


> New Y[]: 
	
	 0  3  0  1  1  0  0  0  0  0  0  0  0  0  0  0  0  2  0  0  0  1  0  0  0  1  0  0  0  0  0  0  0  0  0  0  0  0  0  1 


> New S[]: 
	
	 0  1  0  0  1  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  1 
 > pw :0,26

## ITERATION 98 #######################


> Neighbours evaluated; 215
> Selected Move:	5510	3	17	11	25000


> New Y[]: 
	
	 0  3  0  1  1  0  0  0  0  0  0  2  0  0  0  0  0  0  0  0  0  1  0  0  0  1  0  0  0  0  0  0  0  0  0  0  0  0  0  1 


> New S[]: 
	
	 0  1  0  0  1  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  1 
 > pw :0,255

## ITERATION 99 #######################


> Neighbours evaluated; 229
> Selected Move:	5500	3	11	34	24500


> New Y[]: 
	
	 0  3  0  1  1  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  1  0  0  0  1  0  0  0  0  0  0  0  0  2  0  0  0  0  1 


> New S[]: 
	
	 0  1  0  0  1  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  1  0  0  0  0  0  0  0  0  0  0  0  0  0  0 
 > pw :0,25

## ITERATION 100 #######################


> Neighbours evaluated; 225
> Selected Move:	5390	3	34	2	24500


> New Y[]: 
	
	 0  3  2  1  1  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  1  0  0  0  1  0  0  0  0  0  0  0  0  0  0  0  0  0  1 


> New S[]: 
	
	 0  0  0  1  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  1  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  1 
 > pw :0,245

## ITERATION 101 #######################


> Neighbours evaluated; 257
> Selected Move:	5391	3	2	13	25200


> New Y[]: 
	
	 0  3  0  1  1  0  0  0  0  0  0  0  0  2  0  0  0  0  0  0  0  1  0  0  0  1  0  0  0  0  0  0  0  0  0  0  0  0  0  1 


> New S[]: 
	
	 0  1  0  0  1  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  1  0  0  0  0  0  0  0  0  0  0  0  0  0  0 
 > pw :0,24

## ITERATION 102 #######################


> Neighbours evaluated; 201
> Selected Move:	5440	4	13	25	24600


> New Y[]: 
	
	 0  3  0  1  1  0  0  0  0  0  0  0  0  1  0  0  0  0  0  0  0  1  0  0  0  2  0  0  0  0  0  0  0  0  0  0  0  0  0  1 


> New S[]: 
	
	 0  1  0  0  1  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  1  0  0  0  0  0  0  0  0  0  0  0  0  0  0 
 > pw :0,235

## ITERATION 103 #######################


> Neighbours evaluated; 220
> Selected Move:	5440	4	25	39	24800


> New Y[]: 
	
	 0  3  0  1  1  0  0  0  0  0  0  0  0  1  0  0  0  0  0  0  0  1  0  0  0  1  0  0  0  0  0  0  0  0  0  0  0  0  0  2 


> New S[]: 
	
	 0  1  0  0  1  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  1  0  0  0  0  0  0  0  0  0  0  0  0  0  0 
 > pw :0,23

## ITERATION 104 #######################


> Neighbours evaluated; 222
> Selected Move:	5420	3	39	10	25000


> New Y[]: 
	
	 0  3  0  1  1  0  0  0  0  0  2  0  0  1  0  0  0  0  0  0  0  1  0  0  0  1  0  0  0  0  0  0  0  0  0  0  0  0  0  0 


> New S[]: 
	
	 0  0  0  1  0  0  0  0  0  0  0  0  0  1  0  0  0  0  0  0  0  1  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0 
 > pw :0,225

## ITERATION 105 #######################


> Neighbours evaluated; 220
> Selected Move:	5380	3	10	24	24500


> New Y[]: 
	
	 0  3  0  1  1  0  0  0  0  0  0  0  0  1  0  0  0  0  0  0  0  1  0  0  2  1  0  0  0  0  0  0  0  0  0  0  0  0  0  0 


> New S[]: 
	
	 0  0  0  1  0  0  0  0  0  0  0  0  0  1  0  0  0  0  0  0  0  1  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0 
 > pw :0,22

## ITERATION 106 #######################


> Neighbours evaluated; 238
> Selected Move:	5440	3	4	39	25000


> New Y[]: 
	
	 0  3  0  1  0  0  0  0  0  0  0  0  0  1  0  0  0  0  0  0  0  1  0  0  2  1  0  0  0  0  0  0  0  0  0  0  0  0  0  1 


> New S[]: 
	
	 0  1  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  1  1  0  0  0  0  0  0  0  0  0  0  0  0  0  0 
 > pw :0,215

## ITERATION 107 #######################


> Neighbours evaluated; 243
> Selected Move:	5440	3	24	31	24600


> New Y[]: 
	
	 0  3  0  1  0  0  0  0  0  0  0  0  0  1  0  0  0  0  0  0  0  1  0  0  0  1  0  0  0  0  0  2  0  0  0  0  0  0  0  1 


> New S[]: 
	
	 0  1  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  1  0  0  0  0  0  1  0  0  0  0  0  0  0  0 
 > pw :0,21

## ITERATION 108 #######################


> Neighbours evaluated; 233
> Selected Move:	5398	3	31	4	25200


> New Y[]: 
	
	 0  3  0  1  2  0  0  0  0  0  0  0  0  1  0  0  0  0  0  0  0  1  0  0  0  1  0  0  0  0  0  0  0  0  0  0  0  0  0  1 


> New S[]: 
	
	 0  1  0  0  1  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  1  0  0  0  0  0  0  0  0  0  0  0  0  0  0 
 > pw :0,205

## ITERATION 109 #######################


> Neighbours evaluated; 231
> Selected Move:	5340	3	4	16	24800


> New Y[]: 
	
	 0  3  0  1  0  0  0  0  0  0  0  0  0  1  0  0  2  0  0  0  0  1  0  0  0  1  0  0  0  0  0  0  0  0  0  0  0  0  0  1 


> New S[]: 
	
	 0  0  0  1  0  0  0  0  0  0  0  0  0  1  0  0  0  0  0  0  0  1  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0 
 > pw :0,2

## ITERATION 110 #######################


> Neighbours evaluated; 233
> Selected Move:	5340	3	16	10	25500


> New Y[]: 
	
	 0  3  0  1  0  0  0  0  0  0  2  0  0  1  0  0  0  0  0  0  0  1  0  0  0  1  0  0  0  0  0  0  0  0  0  0  0  0  0  1 


> New S[]: 
	
	 0  1  0  0  0  0  0  0  0  0  1  0  0  0  0  0  0  0  0  0  0  0  0  0  0  1  0  0  0  0  0  0  0  0  0  0  0  0  0  0 
 > pw :0,195

## ITERATION 111 #######################


> Neighbours evaluated; 262
> Selected Move:	5330	3	10	37	24500


> New Y[]: 
	
	 0  3  0  1  0  0  0  0  0  0  0  0  0  1  0  0  0  0  0  0  0  1  0  0  0  1  0  0  0  0  0  0  0  0  0  0  0  2  0  1 


> New S[]: 
	
	 0  0  0  1  0  0  0  0  0  0  0  0  0  1  0  0  0  0  0  0  0  1  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0 
 > pw :0,19

## ITERATION 112 #######################


> Neighbours evaluated; 231
> Selected Move:	5330	4	37	3	25000


> New Y[]: 
	
	 0  3  0  2  0  0  0  0  0  0  0  0  0  1  0  0  0  0  0  0  0  1  0  0  0  1  0  0  0  0  0  0  0  0  0  0  0  1  0  1 


> New S[]: 
	
	 0  0  0  1  0  0  0  0  0  0  0  0  0  1  0  0  0  0  0  0  0  1  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0 
 > pw :0,185

## ITERATION 113 #######################


> Neighbours evaluated; 236
> Selected Move:	5255	3	37	24	26000


> New Y[]: 
	
	 0  3  0  2  0  0  0  0  0  0  0  0  0  1  0  0  0  0  0  0  0  1  0  0  1  1  0  0  0  0  0  0  0  0  0  0  0  0  0  1 


> New S[]: 
	
	 0  1  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  1  1  0  0  0  0  0  0  0  0  0  0  0  0  0  0 
 > pw :0,18

## ITERATION 114 #######################


> Neighbours evaluated; 243
> Selected Move:	5290	3	39	4	25500


> New Y[]: 
	
	 0  3  0  2  1  0  0  0  0  0  0  0  0  1  0  0  0  0  0  0  0  1  0  0  1  1  0  0  0  0  0  0  0  0  0  0  0  0  0  0 


> New S[]: 
	
	 0  0  0  1  0  0  0  0  0  0  0  0  0  1  0  0  0  0  0  0  0  1  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0 
 > pw :0,175

## ITERATION 115 #######################


> Neighbours evaluated; 251
> Selected Move:	5293	3	24	31	25500


> New Y[]: 
	
	 0  3  0  2  1  0  0  0  0  0  0  0  0  1  0  0  0  0  0  0  0  1  0  0  0  1  0  0  0  0  0  1  0  0  0  0  0  0  0  0 


> New S[]: 
	
	 0  0  0  1  0  0  0  0  0  0  0  0  0  1  0  0  0  0  0  0  0  1  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0 
 > pw :0,18

## ITERATION 116 #######################


> Neighbours evaluated; 225
> Selected Move:	5380	4	3	31	24100


> New Y[]: 
	
	 0  3  0  1  1  0  0  0  0  0  0  0  0  1  0  0  0  0  0  0  0  1  0  0  0  1  0  0  0  0  0  2  0  0  0  0  0  0  0  0 


> New S[]: 
	
	 0  0  0  1  0  0  0  0  0  0  0  0  0  1  0  0  0  0  0  0  0  1  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0 
 > pw :0,185

## ITERATION 117 #######################


> Neighbours evaluated; 249
> Selected Move:	5362	3	13	2	25100


> New Y[]: 
	
	 0  3  1  1  1  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  1  0  0  0  1  0  0  0  0  0  2  0  0  0  0  0  0  0  0 


> New S[]: 
	
	 0  0  1  1  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  1  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0 
 > pw :0,19

## ITERATION 118 #######################


> Neighbours evaluated; 259
> Selected Move:	5396	3	4	39	25600


> New Y[]: 
	
	 0  3  1  1  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  1  0  0  0  1  0  0  0  0  0  2  0  0  0  0  0  0  0  1 


> New S[]: 
	
	 0  1  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  1  0  0  0  0  0  0  0  1 
 > pw :0,195

## ITERATION 119 #######################


> Neighbours evaluated; 240
> Selected Move:	5371	3	39	6	25100


> New Y[]: 
	
	 0  3  1  1  0  0  1  0  0  0  0  0  0  0  0  0  0  0  0  0  0  1  0  0  0  1  0  0  0  0  0  2  0  0  0  0  0  0  0  0 


> New S[]: 
	
	 0  1  0  1  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  1  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0 
 > pw :0,2

## ITERATION 120 #######################


> Neighbours evaluated; 262
> Selected Move:	5360	3	31	24	25500


> New Y[]: 
	
	 0  3  1  1  0  0  1  0  0  0  0  0  0  0  0  0  0  0  0  0  0  1  0  0  2  1  0  0  0  0  0  0  0  0  0  0  0  0  0  0 


> New S[]: 
	
	 0  0  1  1  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  1  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0 
 > pw :0,205

## ITERATION 121 #######################


> Neighbours evaluated; 245
> Selected Move:	5310	3	2	13	24500


> New Y[]: 
	
	 0  3  0  1  0  0  1  0  0  0  0  0  0  1  0  0  0  0  0  0  0  1  0  0  2  1  0  0  0  0  0  0  0  0  0  0  0  0  0  0 


> New S[]: 
	
	 0  1  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  1  1  0  0  0  0  0  0  0  0  0  0  0  0  0  0 
 > pw :0,21

## ITERATION 122 #######################


> Neighbours evaluated; 247
> Selected Move:	5310	3	24	0	22500


> New Y[]: 
	
	 2  3  0  1  0  0  1  0  0  0  0  0  0  1  0  0  0  0  0  0  0  1  0  0  0  1  0  0  0  0  0  0  0  0  0  0  0  0  0  0 


> New S[]: 
	
	 1  1  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  1  0  0  0  0  0  0  0  0  0  0  0  0  0  0 
 > pw :0,215

## ITERATION 123 #######################


> Neighbours evaluated; 250
> Selected Move:	5393	1	-1	35	27500


> New Y[]: 
	
	 2  3  0  1  0  0  1  0  0  0  0  0  0  1  0  0  0  0  0  0  0  1  0  0  0  1  0  0  0  0  0  0  0  0  0  1  0  0  0  0 


> New S[]: 
	
	 1  1  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  1  0  0  0  0  0  0  0  0  0  0  0  0  0  0 
 > pw :0,22

## ITERATION 124 #######################


> Neighbours evaluated; 287
> Selected Move:	5400	3	6	39	28000


> New Y[]: 
	
	 2  3  0  1  0  0  0  0  0  0  0  0  0  1  0  0  0  0  0  0  0  1  0  0  0  1  0  0  0  0  0  0  0  0  0  1  0  0  0  1 


> New S[]: 
	
	 1  1  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  1  0  0  0  0  0  0  0  0  0  0  0  0  0  0 
 > pw :0,225

## ITERATION 125 #######################


> Neighbours evaluated; 290
> Selected Move:	5338	3	39	4	27500


> New Y[]: 
	
	 2  3  0  1  1  0  0  0  0  0  0  0  0  1  0  0  0  0  0  0  0  1  0  0  0  1  0  0  0  0  0  0  0  0  0  1  0  0  0  0 


> New S[]: 
	
	 0  0  0  1  0  0  0  0  0  0  0  0  0  1  0  0  0  0  0  0  0  1  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0 
 > pw :0,23

## ITERATION 126 #######################


> Neighbours evaluated; 253
> Selected Move:	5455	3	35	32	26500


> New Y[]: 
	
	 2  3  0  1  1  0  0  0  0  0  0  0  0  1  0  0  0  0  0  0  0  1  0  0  0  1  0  0  0  0  0  0  1  0  0  0  0  0  0  0 


> New S[]: 
	
	 1  1  0  0  1  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0 
 > pw :0,235

## ITERATION 127 #######################


> Neighbours evaluated; 279
> Selected Move:	5373	3	3	7	27500


> New Y[]: 
	
	 2  3  0  0  1  0  0  1  0  0  0  0  0  1  0  0  0  0  0  0  0  1  0  0  0  1  0  0  0  0  0  0  1  0  0  0  0  0  0  0 


> New S[]: 
	
	 0  0  0  0  0  0  0  0  0  0  0  0  0  1  0  0  0  0  0  0  0  1  0  0  0  1  0  0  0  0  0  0  0  0  0  0  0  0  0  0 
 > pw :0,24

## ITERATION 128 #######################


> Neighbours evaluated; 221
> Selected Move:	5360	3	25	28	27500


> New Y[]: 
	
	 2  3  0  0  1  0  0  1  0  0  0  0  0  1  0  0  0  0  0  0  0  1  0  0  0  0  0  0  1  0  0  0  1  0  0  0  0  0  0  0 


> New S[]: 
	
	 0  0  0  0  0  0  0  0  0  0  0  0  0  1  0  0  0  0  0  0  0  1  0  0  0  0  0  0  1  0  0  0  0  0  0  0  0  0  0  0 
 > pw :0,245

## ITERATION 129 #######################


> Neighbours evaluated; 227
> Selected Move:	5290	3	7	6	25000


> New Y[]: 
	
	 2  3  0  0  1  0  1  0  0  0  0  0  0  1  0  0  0  0  0  0  0  1  0  0  0  0  0  0  1  0  0  0  1  0  0  0  0  0  0  0 


> New S[]: 
	
	 0  0  0  0  0  0  0  0  0  0  0  0  0  1  0  0  0  0  0  0  0  1  0  0  0  0  0  0  1  0  0  0  0  0  0  0  0  0  0  0 
 > pw :0,25

## ITERATION 130 #######################


> Neighbours evaluated; 246
> Selected Move:	5315	3	32	25	25500


> New Y[]: 
	
	 2  3  0  0  1  0  1  0  0  0  0  0  0  1  0  0  0  0  0  0  0  1  0  0  0  1  0  0  1  0  0  0  0  0  0  0  0  0  0  0 


> New S[]: 
	
	 0  0  0  0  0  0  0  0  0  0  0  0  0  1  0  0  0  0  0  0  0  1  0  0  0  0  0  0  1  0  0  0  0  0  0  0  0  0  0  0 
 > pw :0,255

## ITERATION 131 #######################


> Neighbours evaluated; 234
> Selected Move:	5290	3	28	32	25000


> New Y[]: 
	
	 2  3  0  0  1  0  1  0  0  0  0  0  0  1  0  0  0  0  0  0  0  1  0  0  0  1  0  0  0  0  0  0  1  0  0  0  0  0  0  0 


> New S[]: 
	
	 0  0  0  0  0  0  0  0  0  0  0  0  0  1  0  0  0  0  0  0  0  1  0  0  0  1  0  0  0  0  0  0  0  0  0  0  0  0  0  0 
 > pw :0,26

## ITERATION 132 #######################


> Neighbours evaluated; 248
> Selected Move:	5220	3	21	28	25000


> New Y[]: 
	
	 2  3  0  0  1  0  1  0  0  0  0  0  0  1  0  0  0  0  0  0  0  0  0  0  0  1  0  0  1  0  0  0  1  0  0  0  0  0  0  0 


> New S[]: 
	
	 1  1  0  0  1  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0 
 > pw :0,265

## ITERATION 133 #######################


> Neighbours evaluated; 235
> Selected Move:	5283	3	6	3	26500


> New Y[]: 
	
	 2  3  0  1  1  0  0  0  0  0  0  0  0  1  0  0  0  0  0  0  0  0  0  0  0  1  0  0  1  0  0  0  1  0  0  0  0  0  0  0 


> New S[]: 
	
	 1  1  0  1  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0 
 > pw :0,27

## ITERATION 134 #######################


> Neighbours evaluated; 282
> Selected Move:	5235	3	3	39	25500


> New Y[]: 
	
	 2  3  0  0  1  0  0  0  0  0  0  0  0  1  0  0  0  0  0  0  0  0  0  0  0  1  0  0  1  0  0  0  1  0  0  0  0  0  0  1 


> New S[]: 
	
	 1  1  0  0  1  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0 
 > pw :0,275

## ITERATION 135 #######################


> Neighbours evaluated; 240
> Selected Move:	5335	3	13	21	26000


> New Y[]: 
	
	 2  3  0  0  1  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  1  0  0  0  1  0  0  1  0  0  0  1  0  0  0  0  0  0  1 


> New S[]: 
	
	 0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  1  0  0  0  1  0  0  1  0  0  0  0  0  0  0  0  0  0  0 
 > pw :0,28

## ITERATION 136 #######################


> Neighbours evaluated; 234
> Selected Move:	5480	3	4	6	26000


> New Y[]: 
	
	 2  3  0  0  0  0  1  0  0  0  0  0  0  0  0  0  0  0  0  0  0  1  0  0  0  1  0  0  1  0  0  0  1  0  0  0  0  0  0  1 


> New S[]: 
	
	 0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  1  0  0  0  1  0  0  1  0  0  0  0  0  0  0  0  0  0  0 
 > pw :0,285

## ITERATION 137 #######################


> Neighbours evaluated; 282
> Selected Move:	5333	3	28	2	26500


> New Y[]: 
	
	 2  3  1  0  0  0  1  0  0  0  0  0  0  0  0  0  0  0  0  0  0  1  0  0  0  1  0  0  0  0  0  0  1  0  0  0  0  0  0  1 


> New S[]: 
	
	 0  0  1  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  1  0  0  0  1  0  0  0  0  0  0  0  0  0  0  0  0  0  0 
 > pw :0,29

## ITERATION 138 #######################


> Neighbours evaluated; 277
> Selected Move:	5195	3	2	13	25500


> New Y[]: 
	
	 2  3  0  0  0  0  1  0  0  0  0  0  0  1  0  0  0  0  0  0  0  1  0  0  0  1  0  0  0  0  0  0  1  0  0  0  0  0  0  1 


> New S[]: 
	
	 1  1  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  1  0  0  0  0  0  0  0  0  0  0  0  0  0  0 
 > pw :0,295

## ITERATION 139 #######################


> Neighbours evaluated; 290
> Selected Move:	5245	3	32	28	26000


> New Y[]: 
	
	 2  3  0  0  0  0  1  0  0  0  0  0  0  1  0  0  0  0  0  0  0  1  0  0  0  1  0  0  1  0  0  0  0  0  0  0  0  0  0  1 


> New S[]: 
	
	 1  1  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  1  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0 
 > pw :0,3

## ITERATION 140 #######################


> Neighbours evaluated; 285
> Selected Move:	5190	3	25	32	25500


> New Y[]: 
	
	 2  3  0  0  0  0  1  0  0  0  0  0  0  1  0  0  0  0  0  0  0  1  0  0  0  0  0  0  1  0  0  0  1  0  0  0  0  0  0  1 


> New S[]: 
	
	 1  1  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  1  0  0  0  0  0  0  0  0  0  0  0 
 > pw :0,305

## ITERATION 141 #######################


> Neighbours evaluated; 289
> Selected Move:	5235	3	39	37	26000


> New Y[]: 
	
	 2  3  0  0  0  0  1  0  0  0  0  0  0  1  0  0  0  0  0  0  0  1  0  0  0  0  0  0  1  0  0  0  1  0  0  0  0  1  0  0 


> New S[]: 
	
	 1  1  0  0  0  0  1  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0 
 > pw :0,31

## ITERATION 142 #######################


> Neighbours evaluated; 288
> Selected Move:	5130	3	28	25	26000


> New Y[]: 
	
	 2  3  0  0  0  0  1  0  0  0  0  0  0  1  0  0  0  0  0  0  0  1  0  0  0  1  0  0  0  0  0  0  1  0  0  0  0  1  0  0 


> New S[]: 
	
	 0  0  0  0  0  0  0  0  0  0  0  0  0  1  0  0  0  0  0  0  0  1  0  0  0  0  0  0  0  0  0  0  1  0  0  0  0  0  0  0 
 > pw :0,315

## ITERATION 143 #######################


> Neighbours evaluated; 287
> Selected Move:	5128	3	37	3	26500


> New Y[]: 
	
	 2  3  0  1  0  0  1  0  0  0  0  0  0  1  0  0  0  0  0  0  0  1  0  0  0  1  0  0  0  0  0  0  1  0  0  0  0  0  0  0 


> New S[]: 
	
	 1  1  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  1  0  0  0  0  0  0  0  0  0  0  0  0  0  0 
 > pw :0,32

## ITERATION 144 #######################


> Neighbours evaluated; 272
> Selected Move:	5230	3	13	28	27000


> New Y[]: 
	
	 2  3  0  1  0  0  1  0  0  0  0  0  0  0  0  0  0  0  0  0  0  1  0  0  0  1  0  0  1  0  0  0  1  0  0  0  0  0  0  0 


> New S[]: 
	
	 1  1  0  0  0  0  1  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0 
 > pw :0,325

## ITERATION 145 #######################


> Neighbours evaluated; 267
> Selected Move:	5128	3	3	4	25500


> New Y[]: 
	
	 2  3  0  0  1  0  1  0  0  0  0  0  0  0  0  0  0  0  0  0  0  1  0  0  0  1  0  0  1  0  0  0  1  0  0  0  0  0  0  0 


> New S[]: 
	
	 0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  1  0  0  0  1  0  0  1  0  0  0  0  0  0  0  0  0  0  0 
 > pw :0,33

## ITERATION 146 #######################


> Neighbours evaluated; 164
> Selected Move:	5210	3	1	3	27000


> New Y[]: 
	
	 2  0  0  3  1  0  1  0  0  0  0  0  0  0  0  0  0  0  0  0  0  1  0  0  0  1  0  0  1  0  0  0  1  0  0  0  0  0  0  0 


> New S[]: 
	
	 1  0  0  0  1  0  1  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0 
 > pw :0,335

## ITERATION 147 #######################


> Neighbours evaluated; 224
> Selected Move:	5098	3	28	13	26500


> New Y[]: 
	
	 2  0  0  3  1  0  1  0  0  0  0  0  0  1  0  0  0  0  0  0  0  1  0  0  0  1  0  0  0  0  0  0  1  0  0  0  0  0  0  0 


> New S[]: 
	
	 1  0  0  0  1  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  1  0  0  0  0  0  0  0  0  0  0  0  0  0  0 
 > pw :0,34

## ITERATION 148 #######################


> Neighbours evaluated; 254
> Selected Move:	5310	2	32	-1	22500


> New Y[]: 
	
	 2  0  0  3  1  0  1  0  0  0  0  0  0  1  0  0  0  0  0  0  0  1  0  0  0  1  0  0  0  0  0  0  0  0  0  0  0  0  0  0 


> New S[]: 
	
	 1  0  0  0  1  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  1  0  0  0  0  0  0  0  0  0  0  0  0  0  0 
 > pw :0,345

## ITERATION 149 #######################


> Neighbours evaluated; 159
> Selected Move:	5440	3	6	39	23000


> New Y[]: 
	
	 2  0  0  3  1  0  0  0  0  0  0  0  0  1  0  0  0  0  0  0  0  1  0  0  0  1  0  0  0  0  0  0  0  0  0  0  0  0  0  1 


> New S[]: 
	
	 1  0  0  0  1  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  1  0  0  0  0  0  0  0  0  0  0  0  0  0  0 
 > pw :0,35

## ITERATION 150 #######################


> Neighbours evaluated; 236
> Selected Move:	5600	3	21	33	25000


> New Y[]: 
	
	 2  0  0  3  1  0  0  0  0  0  0  0  0  1  0  0  0  0  0  0  0  0  0  0  0  1  0  0  0  0  0  0  0  1  0  0  0  0  0  1 


> New S[]: 
	
	 0  0  0  1  0  0  0  0  0  0  0  0  0  1  0  0  0  0  0  0  0  0  0  0  0  1  0  0  0  0  0  0  0  0  0  0  0  0  0  0 
 > pw :0,355

## ITERATION 151 #######################


> Neighbours evaluated; 202
> Selected Move:	5600	4	3	33	24300


> New Y[]: 
	
	 2  0  0  1  1  0  0  0  0  0  0  0  0  1  0  0  0  0  0  0  0  0  0  0  0  1  0  0  0  0  0  0  0  3  0  0  0  0  0  1 


> New S[]: 
	
	 0  0  0  1  0  0  0  0  0  0  0  0  0  1  0  0  0  0  0  0  0  0  0  0  0  1  0  0  0  0  0  0  0  0  0  0  0  0  0  0 
 > pw :0,36

## ITERATION 152 #######################


> Neighbours evaluated; 229
> Selected Move:	5590	3	3	15	24300


> New Y[]: 
	
	 2  0  0  0  1  0  0  0  0  0  0  0  0  1  0  1  0  0  0  0  0  0  0  0  0  1  0  0  0  0  0  0  0  3  0  0  0  0  0  1 


> New S[]: 
	
	 0  0  0  0  0  0  0  0  0  0  0  0  0  1  0  0  0  0  0  0  0  0  0  0  0  1  0  0  0  0  0  0  0  1  0  0  0  0  0  0 
 > pw :0,365

## ITERATION 153 #######################


> Neighbours evaluated; 232
> Selected Move:	5480	3	25	28	24300


> New Y[]: 
	
	 2  0  0  0  1  0  0  0  0  0  0  0  0  1  0  1  0  0  0  0  0  0  0  0  0  0  0  0  1  0  0  0  0  3  0  0  0  0  0  1 


> New S[]: 
	
	 1  0  0  0  1  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  1 
 > pw :0,36

## ITERATION 154 #######################


> Neighbours evaluated; 228
> Selected Move:	5540	3	15	3	24300


> New Y[]: 
	
	 2  0  0  1  1  0  0  0  0  0  0  0  0  1  0  0  0  0  0  0  0  0  0  0  0  0  0  0  1  0  0  0  0  3  0  0  0  0  0  1 


> New S[]: 
	
	 1  0  0  1  1  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0 
 > pw :0,355

## ITERATION 155 #######################


> Neighbours evaluated; 221
> Selected Move:	5540	4	33	3	25000


> New Y[]: 
	
	 2  0  0  3  1  0  0  0  0  0  0  0  0  1  0  0  0  0  0  0  0  0  0  0  0  0  0  0  1  0  0  0  0  1  0  0  0  0  0  1 


> New S[]: 
	
	 1  0  0  1  1  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0 
 > pw :0,35

## ITERATION 156 #######################


> Neighbours evaluated; 237
> Selected Move:	5340	3	3	15	25400


> New Y[]: 
	
	 2  0  0  0  1  0  0  0  0  0  0  0  0  1  0  3  0  0  0  0  0  0  0  0  0  0  0  0  1  0  0  0  0  1  0  0  0  0  0  1 


> New S[]: 
	
	 1  0  0  0  1  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  1 
 > pw :0,345

## ITERATION 157 #######################


> Neighbours evaluated; 227
> Selected Move:	5452	3	28	25	25400


> New Y[]: 
	
	 2  0  0  0  1  0  0  0  0  0  0  0  0  1  0  3  0  0  0  0  0  0  0  0  0  1  0  0  0  0  0  0  0  1  0  0  0  0  0  1 


> New S[]: 
	
	 0  0  0  0  0  0  0  0  0  0  0  0  0  1  0  0  0  0  0  0  0  0  0  0  0  1  0  0  0  0  0  0  0  1  0  0  0  0  0  0 
 > pw :0,34

## ITERATION 158 #######################


> Neighbours evaluated; 236
> Selected Move:	5300	3	33	3	24400


> New Y[]: 
	
	 2  0  0  1  1  0  0  0  0  0  0  0  0  1  0  3  0  0  0  0  0  0  0  0  0  1  0  0  0  0  0  0  0  0  0  0  0  0  0  1 


> New S[]: 
	
	 0  0  0  0  0  0  0  0  0  0  0  0  0  1  0  0  0  0  0  0  0  0  0  0  0  1  0  0  0  0  0  0  0  0  0  0  0  0  0  1 
 > pw :0,335

## ITERATION 159 #######################


> Neighbours evaluated; 209
> Selected Move:	5440	3	15	21	24100


> New Y[]: 
	
	 2  0  0  1  1  0  0  0  0  0  0  0  0  1  0  0  0  0  0  0  0  3  0  0  0  1  0  0  0  0  0  0  0  0  0  0  0  0  0  1 


> New S[]: 
	
	 1  0  0  0  1  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  1  0  0  0  0  0  0  0  0  0  0  0  0  0  0 
 > pw :0,33

## ITERATION 160 #######################


> Neighbours evaluated; 223
> Selected Move:	5477	3	13	2	25100


> New Y[]: 
	
	 2  0  1  1  1  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  3  0  0  0  1  0  0  0  0  0  0  0  0  0  0  0  0  0  1 


> New S[]: 
	
	 1  0  0  0  1  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  1 
 > pw :0,325

## ITERATION 161 #######################


> Neighbours evaluated; 228
> Selected Move:	5510	4	21	2	25000


> New Y[]: 
	
	 2  0  3  1  1  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  1  0  0  0  1  0  0  0  0  0  0  0  0  0  0  0  0  0  1 


> New S[]: 
	
	 1  0  0  0  1  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  1 
 > pw :0,32

## ITERATION 162 #######################


> Neighbours evaluated; 229
> Selected Move:	5510	4	2	3	24000


> New Y[]: 
	
	 2  0  1  3  1  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  1  0  0  0  1  0  0  0  0  0  0  0  0  0  0  0  0  0  1 


> New S[]: 
	
	 1  0  0  0  1  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  1 
 > pw :0,315

## ITERATION 163 #######################


> Neighbours evaluated; 250
> Selected Move:	5540	3	2	17	25000


> New Y[]: 
	
	 2  0  0  3  1  0  0  0  0  0  0  0  0  0  0  0  0  1  0  0  0  1  0  0  0  1  0  0  0  0  0  0  0  0  0  0  0  0  0  1 


> New S[]: 
	
	 1  0  0  0  1  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  1 
 > pw :0,31

## ITERATION 164 #######################


> Neighbours evaluated; 217
> Selected Move:	5510	3	17	11	24500


> New Y[]: 
	
	 2  0  0  3  1  0  0  0  0  0  0  1  0  0  0  0  0  0  0  0  0  1  0  0  0  1  0  0  0  0  0  0  0  0  0  0  0  0  0  1 


> New S[]: 
	
	 1  0  0  0  1  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  1 
 > pw :0,305

## ITERATION 165 #######################


> Neighbours evaluated; 233
> Selected Move:	5500	3	11	34	25000


> New Y[]: 
	
	 2  0  0  3  1  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  1  0  0  0  1  0  0  0  0  0  0  0  0  1  0  0  0  0  1 


> New S[]: 
	
	 1  0  0  0  1  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  1  0  0  0  0  0  0  0  0  0  0  0  0  0  0 
 > pw :0,3

## ITERATION 166 #######################


> Neighbours evaluated; 199
> Selected Move:	5460	3	34	18	24500


> New Y[]: 
	
	 2  0  0  3  1  0  0  0  0  0  0  0  0  0  0  0  0  0  1  0  0  1  0  0  0  1  0  0  0  0  0  0  0  0  0  0  0  0  0  1 


> New S[]: 
	
	 1  0  0  0  1  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  1 
 > pw :0,295

## ITERATION 167 #######################


> Neighbours evaluated; 237
> Selected Move:	5372	4	3	18	25300


> New Y[]: 
	
	 2  0  0  1  1  0  0  0  0  0  0  0  0  0  0  0  0  0  3  0  0  1  0  0  0  1  0  0  0  0  0  0  0  0  0  0  0  0  0  1 


> New S[]: 
	
	 1  0  0  0  1  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  1 
 > pw :0,29

## ITERATION 168 #######################


> Neighbours evaluated; 217
> Selected Move:	5452	3	18	11	25200


> New Y[]: 
	
	 2  0  0  1  1  0  0  0  0  0  0  3  0  0  0  0  0  0  0  0  0  1  0  0  0  1  0  0  0  0  0  0  0  0  0  0  0  0  0  1 


> New S[]: 
	
	 1  0  0  0  1  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  1 
 > pw :0,285

## ITERATION 169 #######################


> Neighbours evaluated; 235
> Selected Move:	5450	3	11	22	24900


> New Y[]: 
	
	 2  0  0  1  1  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  1  3  0  0  1  0  0  0  0  0  0  0  0  0  0  0  0  0  1 


> New S[]: 
	
	 1  0  0  1  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  1  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0 
 > pw :0,28

## ITERATION 170 #######################


> Neighbours evaluated; 220
> Selected Move:	5444	3	22	34	25200


> New Y[]: 
	
	 2  0  0  1  1  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  1  0  0  0  1  0  0  0  0  0  0  0  0  3  0  0  0  0  1 


> New S[]: 
	
	 1  0  0  0  1  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  1  0  0  0  0  0  0  0  0  0  0  0  0  0  0 
 > pw :0,275

## ITERATION 171 #######################


> Neighbours evaluated; 218
> Selected Move:	5440	3	34	13	25000


> New Y[]: 
	
	 2  0  0  1  1  0  0  0  0  0  0  0  0  3  0  0  0  0  0  0  0  1  0  0  0  1  0  0  0  0  0  0  0  0  0  0  0  0  0  1 


> New S[]: 
	
	 1  0  0  0  1  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  1  0  0  0  0  0  0  0  0  0  0  0  0  0  0 
 > pw :0,27

## ITERATION 172 #######################


> Neighbours evaluated; 203
> Selected Move:	5440	4	13	4	24500


> New Y[]: 
	
	 2  0  0  1  3  0  0  0  0  0  0  0  0  1  0  0  0  0  0  0  0  1  0  0  0  1  0  0  0  0  0  0  0  0  0  0  0  0  0  1 


> New S[]: 
	
	 1  0  0  0  1  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  1  0  0  0  0  0  0  0  0  0  0  0  0  0  0 
 > pw :0,265

## ITERATION 173 #######################


> Neighbours evaluated; 223
> Selected Move:	5440	4	4	25	24800


> New Y[]: 
	
	 2  0  0  1  1  0  0  0  0  0  0  0  0  1  0  0  0  0  0  0  0  1  0  0  0  3  0  0  0  0  0  0  0  0  0  0  0  0  0  1 


> New S[]: 
	
	 1  0  0  0  1  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  1  0  0  0  0  0  0  0  0  0  0  0  0  0  0 
 > pw :0,26

## ITERATION 174 #######################


> Neighbours evaluated; 215
> Selected Move:	5440	4	25	39	24800


> New Y[]: 
	
	 2  0  0  1  1  0  0  0  0  0  0  0  0  1  0  0  0  0  0  0  0  1  0  0  0  1  0  0  0  0  0  0  0  0  0  0  0  0  0  3 


> New S[]: 
	
	 1  0  0  0  1  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  1  0  0  0  0  0  0  0  0  0  0  0  0  0  0 
 > pw :0,255

## ITERATION 175 #######################


> Neighbours evaluated; 253
> Selected Move:	5380	3	39	10	24100


> New Y[]: 
	
	 2  0  0  1  1  0  0  0  0  0  3  0  0  1  0  0  0  0  0  0  0  1  0  0  0  1  0  0  0  0  0  0  0  0  0  0  0  0  0  0 


> New S[]: 
	
	 0  0  0  1  0  0  0  0  0  0  0  0  0  1  0  0  0  0  0  0  0  1  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0 
 > pw :0,25

## ITERATION 176 #######################


> Neighbours evaluated; 176
> Selected Move:	5380	4	10	3	25000


> New Y[]: 
	
	 2  0  0  3  1  0  0  0  0  0  1  0  0  1  0  0  0  0  0  0  0  1  0  0  0  1  0  0  0  0  0  0  0  0  0  0  0  0  0  0 


> New S[]: 
	
	 0  0  0  1  0  0  0  0  0  0  0  0  0  1  0  0  0  0  0  0  0  1  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0 
 > pw :0,245

## ITERATION 177 #######################


> Neighbours evaluated; 167
> Selected Move:	5380	3	10	24	24500


> New Y[]: 
	
	 2  0  0  3  1  0  0  0  0  0  0  0  0  1  0  0  0  0  0  0  0  1  0  0  1  1  0  0  0  0  0  0  0  0  0  0  0  0  0  0 


> New S[]: 
	
	 0  0  0  1  0  0  0  0  0  0  0  0  0  1  0  0  0  0  0  0  0  1  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0 
 > pw :0,24

## ITERATION 178 #######################


> Neighbours evaluated; 242
> Selected Move:	5420	3	4	39	25000


> New Y[]: 
	
	 2  0  0  3  0  0  0  0  0  0  0  0  0  1  0  0  0  0  0  0  0  1  0  0  1  1  0  0  0  0  0  0  0  0  0  0  0  0  0  1 


> New S[]: 
	
	 0  0  0  0  0  0  0  0  0  0  0  0  0  1  0  0  0  0  0  0  0  1  0  0  0  1  0  0  0  0  0  0  0  0  0  0  0  0  0  0 
 > pw :0,235

## ITERATION 179 #######################


> Neighbours evaluated; 241
> Selected Move:	5440	3	24	16	25000


> New Y[]: 
	
	 2  0  0  3  0  0  0  0  0  0  0  0  0  1  0  0  1  0  0  0  0  1  0  0  0  1  0  0  0  0  0  0  0  0  0  0  0  0  0  1 


> New S[]: 
	
	 1  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  1  0  0  0  0  0  0  0  0  1  0  0  0  0  0  0  0  0  0  0  0  0  0  0 
 > pw :0,23

## ITERATION 180 #######################


> Neighbours evaluated; 244
> Selected Move:	5420	3	16	31	25000


> New Y[]: 
	
	 2  0  0  3  0  0  0  0  0  0  0  0  0  1  0  0  0  0  0  0  0  1  0  0  0  1  0  0  0  0  0  1  0  0  0  0  0  0  0  1 


> New S[]: 
	
	 0  0  0  0  0  0  0  0  0  0  0  0  0  1  0  0  0  0  0  0  0  1  0  0  0  1  0  0  0  0  0  0  0  0  0  0  0  0  0  0 
 > pw :0,225

## ITERATION 181 #######################


> Neighbours evaluated; 229
> Selected Move:	5420	4	3	31	24800


> New Y[]: 
	
	 2  0  0  1  0  0  0  0  0  0  0  0  0  1  0  0  0  0  0  0  0  1  0  0  0  1  0  0  0  0  0  3  0  0  0  0  0  0  0  1 


> New S[]: 
	
	 0  0  0  0  0  0  0  0  0  0  0  0  0  1  0  0  0  0  0  0  0  1  0  0  0  1  0  0  0  0  0  0  0  0  0  0  0  0  0  0 
 > pw :0,22

## ITERATION 182 #######################


> Neighbours evaluated; 237
> Selected Move:	5420	3	31	24	24700


> New Y[]: 
	
	 2  0  0  1  0  0  0  0  0  0  0  0  0  1  0  0  0  0  0  0  0  1  0  0  3  1  0  0  0  0  0  0  0  0  0  0  0  0  0  1 


> New S[]: 
	
	 0  0  0  0  0  0  0  0  0  0  0  0  0  1  0  0  0  0  0  0  0  1  0  0  0  1  0  0  0  0  0  0  0  0  0  0  0  0  0  0 
 > pw :0,215

## ITERATION 183 #######################


> Neighbours evaluated; 246
> Selected Move:	5419	3	24	16	25100


> New Y[]: 
	
	 2  0  0  1  0  0  0  0  0  0  0  0  0  1  0  0  3  0  0  0  0  1  0  0  0  1  0  0  0  0  0  0  0  0  0  0  0  0  0  1 


> New S[]: 
	
	 1  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  1  0  0  0  0  0  0  0  0  1  0  0  0  0  0  0  0  0  0  0  0  0  0  0 
 > pw :0,21

## ITERATION 184 #######################


> Neighbours evaluated; 257
> Selected Move:	5310	3	16	10	24600


> New Y[]: 
	
	 2  0  0  1  0  0  0  0  0  0  3  0  0  1  0  0  0  0  0  0  0  1  0  0  0  1  0  0  0  0  0  0  0  0  0  0  0  0  0  1 


> New S[]: 
	
	 0  0  0  0  0  0  0  0  0  0  0  0  0  1  0  0  0  0  0  0  0  1  0  0  0  1  0  0  0  0  0  0  0  0  0  0  0  0  0  0 
 > pw :0,205

## ITERATION 185 #######################


> Neighbours evaluated; 247
> Selected Move:	5309	3	10	37	25300


> New Y[]: 
	
	 2  0  0  1  0  0  0  0  0  0  0  0  0  1  0  0  0  0  0  0  0  1  0  0  0  1  0  0  0  0  0  0  0  0  0  0  0  3  0  1 


> New S[]: 
	
	 1  0  0  1  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  1 
 > pw :0,2

## ITERATION 186 #######################


> Neighbours evaluated; 229
> Selected Move:	5370	4	37	3	24000


> New Y[]: 
	
	 2  0  0  3  0  0  0  0  0  0  0  0  0  1  0  0  0  0  0  0  0  1  0  0  0  1  0  0  0  0  0  0  0  0  0  0  0  1  0  1 


> New S[]: 
	
	 1  0  0  1  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  1 
 > pw :0,195

## ITERATION 187 #######################


> Neighbours evaluated; 240
> Selected Move:	5410	3	25	14	25000


> New Y[]: 
	
	 2  0  0  3  0  0  0  0  0  0  0  0  0  1  1  0  0  0  0  0  0  1  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  1  0  1 


> New S[]: 
	
	 0  0  0  1  0  0  0  0  0  0  0  0  0  1  0  0  0  0  0  0  0  1  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0 
 > pw :0,19

## ITERATION 188 #######################


> Neighbours evaluated; 247
> Selected Move:	5334	4	3	14	25400


> New Y[]: 
	
	 2  0  0  1  0  0  0  0  0  0  0  0  0  1  3  0  0  0  0  0  0  1  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  1  0  1 


> New S[]: 
	
	 0  0  0  1  0  0  0  0  0  0  0  0  0  1  0  0  0  0  0  0  0  1  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0 
 > pw :0,185

## ITERATION 189 #######################


> Neighbours evaluated; 248
> Selected Move:	5440	3	14	36	25000


> New Y[]: 
	
	 2  0  0  1  0  0  0  0  0  0  0  0  0  1  0  0  0  0  0  0  0  1  0  0  0  0  0  0  0  0  0  0  0  0  0  0  3  1  0  1 


> New S[]: 
	
	 1  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  1  1  0  0 
 > pw :0,18

## ITERATION 190 #######################


> Neighbours evaluated; 239
> Selected Move:	5440	3	37	4	24000


> New Y[]: 
	
	 2  0  0  1  1  0  0  0  0  0  0  0  0  1  0  0  0  0  0  0  0  1  0  0  0  0  0  0  0  0  0  0  0  0  0  0  3  0  0  1 


> New S[]: 
	
	 1  0  0  0  1  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  1  0  0  0 
 > pw :0,175

## ITERATION 191 #######################


> Neighbours evaluated; 243
> Selected Move:	5480	3	13	2	25000


> New Y[]: 
	
	 2  0  1  1  1  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  1  0  0  0  0  0  0  0  0  0  0  0  0  0  0  3  0  0  1 


> New S[]: 
	
	 0  0  1  1  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  1  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0 
 > pw :0,17

## ITERATION 192 #######################


> Neighbours evaluated; 257
> Selected Move:	5480	3	2	28	24500


> New Y[]: 
	
	 2  0  0  1  1  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  1  0  0  0  0  0  0  1  0  0  0  0  0  0  0  3  0  0  1 


> New S[]: 
	
	 0  0  0  1  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  1  0  0  0  0  0  0  1  0  0  0  0  0  0  0  0  0  0  0 
 > pw :0,165

## ITERATION 193 #######################


> Neighbours evaluated; 228
> Selected Move:	5443	1	-1	32	28500


> New Y[]: 
	
	 2  0  0  1  1  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  1  0  0  0  0  0  0  1  0  0  0  1  0  0  0  3  0  0  1 


> New S[]: 
	
	 1  0  0  0  1  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  1 
 > pw :0,16

## ITERATION 194 #######################


> Neighbours evaluated; 290
> Selected Move:	5530	3	39	6	28000


> New Y[]: 
	
	 2  0  0  1  1  0  1  0  0  0  0  0  0  0  0  0  0  0  0  0  0  1  0  0  0  0  0  0  1  0  0  0  1  0  0  0  3  0  0  0 


> New S[]: 
	
	 1  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  1  0  0  0  0  0  0  0  1  0  0  0 
 > pw :0,155

## ITERATION 195 #######################


> Neighbours evaluated; 248
> Selected Move:	5443	3	36	26	28400


> New Y[]: 
	
	 2  0  0  1  1  0  1  0  0  0  0  0  0  0  0  0  0  0  0  0  0  1  0  0  0  0  3  0  1  0  0  0  1  0  0  0  0  0  0  0 


> New S[]: 
	
	 0  0  0  1  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  1  0  0  0  0  0  0  1  0  0  0  0  0  0  0  0  0  0  0 
 > pw :0,15

## ITERATION 196 #######################


> Neighbours evaluated; 236
> Selected Move:	5520	4	26	3	28000


> New Y[]: 
	
	 2  0  0  3  1  0  1  0  0  0  0  0  0  0  0  0  0  0  0  0  0  1  0  0  0  0  1  0  1  0  0  0  1  0  0  0  0  0  0  0 


> New S[]: 
	
	 0  0  0  1  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  1  0  0  0  0  0  0  1  0  0  0  0  0  0  0  0  0  0  0 
 > pw :0,155

## ITERATION 197 #######################


> Neighbours evaluated; 244
> Selected Move:	5508	3	6	39	28500


> New Y[]: 
	
	 2  0  0  3  1  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  1  0  0  0  0  1  0  1  0  0  0  1  0  0  0  0  0  0  1 


> New S[]: 
	
	 1  0  0  0  1  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  1 
 > pw :0,16

## ITERATION 198 #######################


> Neighbours evaluated; 285
> Selected Move:	5470	3	26	25	27500


> New Y[]: 
	
	 2  0  0  3  1  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  1  0  0  0  1  0  0  1  0  0  0  1  0  0  0  0  0  0  1 


> New S[]: 
	
	 1  0  0  0  1  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  1 
 > pw :0,165

## ITERATION 199 #######################


> Neighbours evaluated; 290
> Selected Move:	5473	3	21	29	28500


> New Y[]: 
	
	 2  0  0  3  1  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  1  0  0  1  1  0  0  1  0  0  0  0  0  0  1 


> New S[]: 
	
	 0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  1  0  0  1  0  0  0  1  0  0  0  0  0  0  0 
 > pw :0,17

## ITERATION 200 #######################


> Neighbours evaluated; 284
> Selected Move:	5420	3	28	13	28000


> New Y[]: 
	
	 2  0  0  3  1  0  0  0  0  0  0  0  0  1  0  0  0  0  0  0  0  0  0  0  0  1  0  0  0  1  0  0  1  0  0  0  0  0  0  1 


> New S[]: 
	
	 1  0  0  0  1  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  1  0  0  0  0  0  0  0  0  0  0  0  0  0  0 
 > pw :0,175

## ITERATION 201 #######################


> Neighbours evaluated; 298
> Selected Move:	5463	3	29	35	27500


> New Y[]: 
	
	 2  0  0  3  1  0  0  0  0  0  0  0  0  1  0  0  0  0  0  0  0  0  0  0  0  1  0  0  0  0  0  0  1  0  0  1  0  0  0  1 


> New S[]: 
	
	 0  0  0  1  0  0  0  0  0  0  0  0  0  1  0  0  0  0  0  0  0  0  0  0  0  1  0  0  0  0  0  0  0  0  0  0  0  0  0  0 
 > pw :0,18

## ITERATION 202 #######################


> Neighbours evaluated; 298
> Selected Move:	5520	3	32	21	28000


> New Y[]: 
	
	 2  0  0  3  1  0  0  0  0  0  0  0  0  1  0  0  0  0  0  0  0  1  0  0  0  1  0  0  0  0  0  0  0  0  0  1  0  0  0  1 


> New S[]: 
	
	 1  0  0  0  1  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  1  0  0  0  0  0  0  0  0  0  0  0  0  0  0 
 > pw :0,185

## ITERATION 203 #######################


> Neighbours evaluated; 282
> Selected Move:	5468	3	39	6	27500


> New Y[]: 
	
	 2  0  0  3  1  0  1  0  0  0  0  0  0  1  0  0  0  0  0  0  0  1  0  0  0  1  0  0  0  0  0  0  0  0  0  1  0  0  0  0 


> New S[]: 
	
	 1  0  0  0  1  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  1  0  0  0  0  0  0  0  0  0  0  0  0  0  0 
 > pw :0,19

## ITERATION 204 #######################


> Neighbours evaluated; 269
> Selected Move:	5450	3	35	39	27000


> New Y[]: 
	
	 2  0  0  3  1  0  1  0  0  0  0  0  0  1  0  0  0  0  0  0  0  1  0  0  0  1  0  0  0  0  0  0  0  0  0  0  0  0  0  1 


> New S[]: 
	
	 0  0  0  1  0  0  0  0  0  0  0  0  0  1  0  0  0  0  0  0  0  1  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0 
 > pw :0,195

## ITERATION 205 #######################


> Neighbours evaluated; 270
> Selected Move:	5460	3	25	28	27000


> New Y[]: 
	
	 2  0  0  3  1  0  1  0  0  0  0  0  0  1  0  0  0  0  0  0  0  1  0  0  0  0  0  0  1  0  0  0  0  0  0  0  0  0  0  1 


> New S[]: 
	
	 0  0  0  0  0  0  0  0  0  0  0  0  0  1  0  0  0  0  0  0  0  1  0  0  0  0  0  0  1  0  0  0  0  0  0  0  0  0  0  0 
 > pw :0,2

## ITERATION 206 #######################


> Neighbours evaluated; 268
> Selected Move:	5470	3	4	37	28000


> New Y[]: 
	
	 2  0  0  3  0  0  1  0  0  0  0  0  0  1  0  0  0  0  0  0  0  1  0  0  0  0  0  0  1  0  0  0  0  0  0  0  0  1  0  1 


> New S[]: 
	
	 1  0  0  1  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  1  0  0 
 > pw :0,205

## ITERATION 207 #######################


> Neighbours evaluated; 274
> Selected Move:	5415	3	6	4	28000


> New Y[]: 
	
	 2  0  0  3  1  0  0  0  0  0  0  0  0  1  0  0  0  0  0  0  0  1  0  0  0  0  0  0  1  0  0  0  0  0  0  0  0  1  0  1 


> New S[]: 
	
	 0  0  0  1  0  0  0  0  0  0  0  0  0  1  0  0  0  0  0  0  0  1  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0 
 > pw :0,21

## ITERATION 208 #######################


> Neighbours evaluated; 278
> Selected Move:	5385	3	21	32	27500


> New Y[]: 
	
	 2  0  0  3  1  0  0  0  0  0  0  0  0  1  0  0  0  0  0  0  0  0  0  0  0  0  0  0  1  0  0  0  1  0  0  0  0  1  0  1 


> New S[]: 
	
	 1  0  0  1  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  1 
 > pw :0,215

## ITERATION 209 #######################


> Neighbours evaluated; 298
> Selected Move:	5287	3	3	15	27900


> New Y[]: 
	
	 2  0  0  0  1  0  0  0  0  0  0  0  0  1  0  3  0  0  0  0  0  0  0  0  0  0  0  0  1  0  0  0  1  0  0  0  0  1  0  1 


> New S[]: 
	
	 1  0  0  0  0  0  0  0  0  0  0  0  0  0  0  1  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  1 
 > pw :0,22

## ITERATION 210 #######################


> Neighbours evaluated; 298
> Selected Move:	5232	3	32	21	28400


> New Y[]: 
	
	 2  0  0  0  1  0  0  0  0  0  0  0  0  1  0  3  0  0  0  0  0  1  0  0  0  0  0  0  1  0  0  0  0  0  0  0  0  1  0  1 


> New S[]: 
	
	 1  0  0  0  1  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  1 
 > pw :0,225

## ITERATION 211 #######################


> Neighbours evaluated; 262
> Selected Move:	5200	3	37	6	27400


> New Y[]: 
	
	 2  0  0  0  1  0  1  0  0  0  0  0  0  1  0  3  0  0  0  0  0  1  0  0  0  0  0  0  1  0  0  0  0  0  0  0  0  0  0  1 


> New S[]: 
	
	 0  0  0  0  0  0  0  0  0  0  0  0  0  1  0  0  0  0  0  0  0  1  0  0  0  0  0  0  1  0  0  0  0  0  0  0  0  0  0  0 
 > pw :0,23

## ITERATION 212 #######################


> Neighbours evaluated; 265
> Selected Move:	5188	3	28	25	27400


> New Y[]: 
	
	 2  0  0  0  1  0  1  0  0  0  0  0  0  1  0  3  0  0  0  0  0  1  0  0  0  1  0  0  0  0  0  0  0  0  0  0  0  0  0  1 


> New S[]: 
	
	 0  0  0  0  0  0  0  0  0  0  0  0  0  1  0  0  0  0  0  0  0  1  0  0  0  1  0  0  0  0  0  0  0  0  0  0  0  0  0  0 
 > pw :0,235

## ITERATION 213 #######################


> Neighbours evaluated; 261
> Selected Move:	5150	3	15	33	27300


> New Y[]: 
	
	 2  0  0  0  1  0  1  0  0  0  0  0  0  1  0  0  0  0  0  0  0  1  0  0  0  1  0  0  0  0  0  0  0  3  0  0  0  0  0  1 


> New S[]: 
	
	 1  0  0  0  1  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  1  0  0  0  0  0  0  0  0  0  0  0  0  0  0 
 > pw :0,24

## ITERATION 214 #######################


> Neighbours evaluated; 248
> Selected Move:	5168	3	6	3	28800


> New Y[]: 
	
	 2  0  0  1  1  0  0  0  0  0  0  0  0  1  0  0  0  0  0  0  0  1  0  0  0  1  0  0  0  0  0  0  0  3  0  0  0  0  0  1 


> New S[]: 
	
	 1  0  0  0  1  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  1  0  0  0  0  0  0  0  0  0  0  0  0  0  0 
 > pw :0,245

## ITERATION 215 #######################


> Neighbours evaluated; 270
> Selected Move:	5267	3	21	35	29300


> New Y[]: 
	
	 2  0  0  1  1  0  0  0  0  0  0  0  0  1  0  0  0  0  0  0  0  0  0  0  0  1  0  0  0  0  0  0  0  3  0  1  0  0  0  1 


> New S[]: 
	
	 0  0  0  0  0  0  0  0  0  0  0  0  0  1  0  0  0  0  0  0  0  0  0  0  0  1  0  0  0  0  0  0  0  1  0  0  0  0  0  0 
 > pw :0,25

## ITERATION 216 #######################


> Neighbours evaluated; 295
> Selected Move:	5310	2	39	-1	24800


> New Y[]: 
	
	 2  0  0  1  1  0  0  0  0  0  0  0  0  1  0  0  0  0  0  0  0  0  0  0  0  1  0  0  0  0  0  0  0  3  0  1  0  0  0  0 


> New S[]: 
	
	 1  0  0  1  1  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0 
 > pw :0,255

## ITERATION 217 #######################


> Neighbours evaluated; 256
> Selected Move:	5280	3	35	6	23800


> New Y[]: 
	
	 2  0  0  1  1  0  1  0  0  0  0  0  0  1  0  0  0  0  0  0  0  0  0  0  0  1  0  0  0  0  0  0  0  3  0  0  0  0  0  0 


> New S[]: 
	
	 0  0  0  1  0  0  0  0  0  0  0  0  0  1  0  0  0  0  0  0  0  0  0  0  0  1  0  0  0  0  0  0  0  0  0  0  0  0  0  0 
 > pw :0,26

## ITERATION 218 #######################


> Neighbours evaluated; 221
> Selected Move:	5310	3	33	21	23600


> New Y[]: 
	
	 2  0  0  1  1  0  1  0  0  0  0  0  0  1  0  0  0  0  0  0  0  3  0  0  0  1  0  0  0  0  0  0  0  0  0  0  0  0  0  0 


> New S[]: 
	
	 1  0  0  0  1  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  1  0  0  0  0  0  0  0  0  0  0  0  0  0  0 
 > pw :0,265

## ITERATION 219 #######################


> Neighbours evaluated; 222
> Selected Move:	5334	3	13	11	25100


> New Y[]: 
	
	 2  0  0  1  1  0  1  0  0  0  0  1  0  0  0  0  0  0  0  0  0  3  0  0  0  1  0  0  0  0  0  0  0  0  0  0  0  0  0  0 


> New S[]: 
	
	 0  0  0  1  0  0  0  0  0  0  0  1  0  0  0  0  0  0  0  0  0  1  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0 
 > pw :0,27

## ITERATION 220 #######################


> Neighbours evaluated; 166
> Selected Move:	5360	4	21	3	24000


> New Y[]: 
	
	 2  0  0  3  1  0  1  0  0  0  0  1  0  0  0  0  0  0  0  0  0  1  0  0  0  1  0  0  0  0  0  0  0  0  0  0  0  0  0  0 


> New S[]: 
	
	 0  0  0  1  0  0  0  0  0  0  0  1  0  0  0  0  0  0  0  0  0  1  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0 
 > pw :0,275

## ITERATION 221 #######################


> Neighbours evaluated; 214
> Selected Move:	5360	4	3	11	24700


> New Y[]: 
	
	 2  0  0  1  1  0  1  0  0  0  0  3  0  0  0  0  0  0  0  0  0  1  0  0  0  1  0  0  0  0  0  0  0  0  0  0  0  0  0  0 


> New S[]: 
	
	 0  0  0  1  0  0  0  0  0  0  0  1  0  0  0  0  0  0  0  0  0  1  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0 
 > pw :0,28

## ITERATION 222 #######################


> Neighbours evaluated; 195
> Selected Move:	5360	3	11	17	24900


> New Y[]: 
	
	 2  0  0  1  1  0  1  0  0  0  0  0  0  0  0  0  0  3  0  0  0  1  0  0  0  1  0  0  0  0  0  0  0  0  0  0  0  0  0  0 


> New S[]: 
	
	 0  0  0  1  0  0  0  0  0  0  0  0  0  0  0  0  0  1  0  0  0  1  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0 
 > pw :0,275

## ITERATION 223 #######################


> Neighbours evaluated; 130
> Selected Move:	5430	3	6	39	25400


> New Y[]: 
	
	 2  0  0  1  1  0  0  0  0  0  0  0  0  0  0  0  0  3  0  0  0  1  0  0  0  1  0  0  0  0  0  0  0  0  0  0  0  0  0  1 


> New S[]: 
	
	 1  0  0  0  1  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  1 
 > pw :0,27

## ITERATION 224 #######################


> Neighbours evaluated; 223
> Selected Move:	5406	3	17	30	25200


> New Y[]: 
	
	 2  0  0  1  1  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  1  0  0  0  1  0  0  0  0  3  0  0  0  0  0  0  0  0  1 


> New S[]: 
	
	 1  0  0  0  1  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  1 
 > pw :0,265

## ITERATION 225 #######################


> Neighbours evaluated; 217
> Selected Move:	5328	4	30	3	25500


> New Y[]: 
	
	 2  0  0  3  1  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  1  0  0  0  1  0  0  0  0  1  0  0  0  0  0  0  0  0  1 


> New S[]: 
	
	 1  0  0  0  1  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  1 
 > pw :0,26

## ITERATION 226 #######################


> Neighbours evaluated; 227
> Selected Move:	5360	3	30	28	23500


> New Y[]: 
	
	 2  0  0  3  1  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  1  0  0  0  1  0  0  1  0  0  0  0  0  0  0  0  0  0  1 


> New S[]: 
	
	 1  0  0  1  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  1  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0 
 > pw :0,255

## ITERATION 227 #######################


> Neighbours evaluated; 234
> Selected Move:	5360	4	3	4	25000


> New Y[]: 
	
	 2  0  0  1  3  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  1  0  0  0  1  0  0  1  0  0  0  0  0  0  0  0  0  0  1 


> New S[]: 
	
	 1  0  0  1  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  1  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0 
 > pw :0,25

## ITERATION 228 #######################


> Neighbours evaluated; 219
> Selected Move:	5385	3	28	2	25500


> New Y[]: 
	
	 2  0  1  1  3  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  1  0  0  0  1  0  0  0  0  0  0  0  0  0  0  0  0  0  1 


> New S[]: 
	
	 1  0  0  0  1  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  1 
 > pw :0,255

## ITERATION 229 #######################


> Neighbours evaluated; 247
> Selected Move:	5306	4	4	25	25800


> New Y[]: 
	
	 2  0  1  1  1  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  1  0  0  0  3  0  0  0  0  0  0  0  0  0  0  0  0  0  1 


> New S[]: 
	
	 1  0  0  0  1  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  1 
 > pw :0,26

## ITERATION 230 #######################


> Neighbours evaluated; 242
> Selected Move:	5302	4	25	39	25800


> New Y[]: 
	
	 2  0  1  1  1  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  1  0  0  0  1  0  0  0  0  0  0  0  0  0  0  0  0  0  3 


> New S[]: 
	
	 1  0  0  0  1  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  1 
 > pw :0,265

## ITERATION 231 #######################


> Neighbours evaluated; 251
> Selected Move:	5281	3	2	28	25300


> New Y[]: 
	
	 2  0  0  1  1  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  1  0  0  0  1  0  0  1  0  0  0  0  0  0  0  0  0  0  3 


> New S[]: 
	
	 1  0  0  1  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  1  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0 
 > pw :0,27

## ITERATION 232 #######################


> Neighbours evaluated; 213
> Selected Move:	5360	4	39	21	24600


> New Y[]: 
	
	 2  0  0  1  1  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  3  0  0  0  1  0  0  1  0  0  0  0  0  0  0  0  0  0  1 


> New S[]: 
	
	 1  0  0  1  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  1  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0 
 > pw :0,275

## ITERATION 233 #######################


> Neighbours evaluated; 230
> Selected Move:	5360	3	21	33	24800


> New Y[]: 
	
	 2  0  0  1  1  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  1  0  0  1  0  0  0  0  3  0  0  0  0  0  1 


> New S[]: 
	
	 1  0  0  1  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  1  0  0  0  0  0  0 
 > pw :0,28

## ITERATION 234 #######################


> Neighbours evaluated; 227
> Selected Move:	5496	3	28	2	25300


> New Y[]: 
	
	 2  0  1  1  1  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  1  0  0  0  0  0  0  0  3  0  0  0  0  0  1 


> New S[]: 
	
	 0  0  0  1  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  1  0  0  0  0  0  0  0  1  0  0  0  0  0  0 
 > pw :0,285

## ITERATION 235 #######################


> Neighbours evaluated; 237
> Selected Move:	5495	3	3	15	25300


> New Y[]: 
	
	 2  0  1  0  1  0  0  0  0  0  0  0  0  0  0  1  0  0  0  0  0  0  0  0  0  1  0  0  0  0  0  0  0  3  0  0  0  0  0  1 


> New S[]: 
	
	 0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  1  0  0  0  0  0  0  0  0  0  1  0  0  0  0  0  0  0  1  0  0  0  0  0  0 
 > pw :0,29

## ITERATION 236 #######################


> Neighbours evaluated; 215
> Selected Move:	5360	3	2	28	24800


> New Y[]: 
	
	 2  0  0  0  1  0  0  0  0  0  0  0  0  0  0  1  0  0  0  0  0  0  0  0  0  1  0  0  1  0  0  0  0  3  0  0  0  0  0  1 


> New S[]: 
	
	 1  0  0  0  0  0  0  0  0  0  0  0  0  0  0  1  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  1  0  0  0  0  0  0 
 > pw :0,295

## ITERATION 237 #######################


> Neighbours evaluated; 232
> Selected Move:	5354	3	28	11	25800


> New Y[]: 
	
	 2  0  0  0  1  0  0  0  0  0  0  1  0  0  0  1  0  0  0  0  0  0  0  0  0  1  0  0  0  0  0  0  0  3  0  0  0  0  0  1 


> New S[]: 
	
	 0  0  0  0  0  0  0  0  0  0  0  1  0  0  0  0  0  0  0  0  0  0  0  0  0  1  0  0  0  0  0  0  0  1  0  0  0  0  0  0 
 > pw :0,3

## ITERATION 238 #######################


> Neighbours evaluated; 242
> Selected Move:	5360	3	15	3	25800


> New Y[]: 
	
	 2  0  0  1  1  0  0  0  0  0  0  1  0  0  0  0  0  0  0  0  0  0  0  0  0  1  0  0  0  0  0  0  0  3  0  0  0  0  0  1 


> New S[]: 
	
	 0  0  0  1  0  0  0  0  0  0  0  1  0  0  0  0  0  0  0  0  0  0  0  0  0  1  0  0  0  0  0  0  0  0  0  0  0  0  0  0 
 > pw :0,305

## ITERATION 239 #######################


> Neighbours evaluated; 237
> Selected Move:	5327	3	33	21	25600


> New Y[]: 
	
	 2  0  0  1  1  0  0  0  0  0  0  1  0  0  0  0  0  0  0  0  0  3  0  0  0  1  0  0  0  0  0  0  0  0  0  0  0  0  0  1 


> New S[]: 
	
	 1  0  0  0  1  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  1 
 > pw :0,31

## ITERATION 240 #######################


> Neighbours evaluated; 226
> Selected Move:	5274	3	11	18	25600


> New Y[]: 
	
	 2  0  0  1  1  0  0  0  0  0  0  0  0  0  0  0  0  0  1  0  0  3  0  0  0  1  0  0  0  0  0  0  0  0  0  0  0  0  0  1 


> New S[]: 
	
	 1  0  0  0  1  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  1 
 > pw :0,315

## ITERATION 241 #######################


> Neighbours evaluated; 219
> Selected Move:	5278	3	21	33	25800


> New Y[]: 
	
	 2  0  0  1  1  0  0  0  0  0  0  0  0  0  0  0  0  0  1  0  0  0  0  0  0  1  0  0  0  0  0  0  0  3  0  0  0  0  0  1 


> New S[]: 
	
	 0  0  0  1  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  1  0  0  0  0  0  0  0  1  0  0  0  0  0  0 
 > pw :0,32

## ITERATION 242 #######################


> Neighbours evaluated; 215
> Selected Move:	5274	3	3	15	25800


> New Y[]: 
	
	 2  0  0  0  1  0  0  0  0  0  0  0  0  0  0  1  0  0  1  0  0  0  0  0  0  1  0  0  0  0  0  0  0  3  0  0  0  0  0  1 


> New S[]: 
	
	 0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  1  0  0  0  0  0  0  0  0  0  1  0  0  0  0  0  0  0  1  0  0  0  0  0  0 
 > pw :0,325

## ITERATION 243 #######################


> Neighbours evaluated; 213
> Selected Move:	5168	3	18	17	26300


> New Y[]: 
	
	 2  0  0  0  1  0  0  0  0  0  0  0  0  0  0  1  0  1  0  0  0  0  0  0  0  1  0  0  0  0  0  0  0  3  0  0  0  0  0  1 


> New S[]: 
	
	 0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  1  0  0  0  0  0  0  0  1  0  0  0  0  0  0  0  1  0  0  0  0  0  0 
 > pw :0,33

## ITERATION 244 #######################


> Neighbours evaluated; 210
> Selected Move:	5171	3	15	3	26300


> New Y[]: 
	
	 2  0  0  1  1  0  0  0  0  0  0  0  0  0  0  0  0  1  0  0  0  0  0  0  0  1  0  0  0  0  0  0  0  3  0  0  0  0  0  1 


> New S[]: 
	
	 0  0  0  1  0  0  0  0  0  0  0  0  0  0  0  0  0  1  0  0  0  0  0  0  0  1  0  0  0  0  0  0  0  0  0  0  0  0  0  0 
 > pw :0,335

## ITERATION 245 #######################


> Neighbours evaluated; 215
> Selected Move:	5190	3	17	21	24800


> New Y[]: 
	
	 2  0  0  1  1  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  1  0  0  0  1  0  0  0  0  0  0  0  3  0  0  0  0  0  1 


> New S[]: 
	
	 1  0  0  0  1  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  1  0  0  0  0  0  0  0  0  0  0  0  0  0  0 
 > pw :0,34

## ITERATION 246 #######################


> Neighbours evaluated; 218
> Selected Move:	5270	3	33	23	24700


> New Y[]: 
	
	 2  0  0  1  1  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  1  0  3  0  1  0  0  0  0  0  0  0  0  0  0  0  0  0  1 


> New S[]: 
	
	 1  0  0  1  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  1  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0 
 > pw :0,345

## ITERATION 247 #######################


> Neighbours evaluated; 228
> Selected Move:	5250	3	23	20	24900


> New Y[]: 
	
	 2  0  0  1  1  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  3  1  0  0  0  1  0  0  0  0  0  0  0  0  0  0  0  0  0  1 


> New S[]: 
	
	 1  0  0  0  1  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  1  0  0  0  0  0  0  0  0  0  0  0  0  0  0 
 > pw :0,35

## ITERATION 248 #######################


> Neighbours evaluated; 208
> Selected Move:	5235	3	20	38	25300


> New Y[]: 
	
	 2  0  0  1  1  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  1  0  0  0  1  0  0  0  0  0  0  0  0  0  0  0  0  3  1 


> New S[]: 
	
	 1  0  0  0  1  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  1  0  0  0  0  0  0  0  0  0  0  0  0  0  0 
 > pw :0,355

## ITERATION 249 #######################


> Neighbours evaluated; 185
> Selected Move:	5340	4	38	3	25000


> New Y[]: 
	
	 2  0  0  3  1  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  1  0  0  0  1  0  0  0  0  0  0  0  0  0  0  0  0  1  1 


> New S[]: 
	
	 1  0  0  0  1  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  1  0  0  0  0  0  0  0  0  0  0  0  0  0  0 
 > pw :0,36

## ITERATION 250 #######################


> Neighbours evaluated; 221
> Selected Move:	5270	3	38	22	25500


> New Y[]: 
	
	 2  0  0  3  1  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  1  1  0  0  1  0  0  0  0  0  0  0  0  0  0  0  0  0  1 


> New S[]: 
	
	 1  0  0  1  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  1  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0 
 > pw :0,365

## ITERATION 251 #######################


> Neighbours evaluated; 217
> Selected Move:	5110	3	21	32	25000


> New Y[]: 
	
	 2  0  0  3  1  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  1  0  0  1  0  0  0  0  0  0  1  0  0  0  0  0  0  1 


> New S[]: 
	
	 1  0  0  1  1  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0 
 > pw :0,37

## ITERATION 252 #######################


> Neighbours evaluated; 236
> Selected Move:	5160	3	22	11	24000


> New Y[]: 
	
	 2  0  0  3  1  0  0  0  0  0  0  1  0  0  0  0  0  0  0  0  0  0  0  0  0  1  0  0  0  0  0  0  1  0  0  0  0  0  0  1 


> New S[]: 
	
	 0  0  0  1  0  0  0  0  0  0  0  1  0  0  0  0  0  0  0  0  0  0  0  0  0  1  0  0  0  0  0  0  0  0  0  0  0  0  0  0 
 > pw :0,365

## ITERATION 253 #######################


> Neighbours evaluated; 258
> Selected Move:	5160	4	3	11	24700


> New Y[]: 
	
	 2  0  0  1  1  0  0  0  0  0  0  3  0  0  0  0  0  0  0  0  0  0  0  0  0  1  0  0  0  0  0  0  1  0  0  0  0  0  0  1 


> New S[]: 
	
	 0  0  0  1  0  0  0  0  0  0  0  1  0  0  0  0  0  0  0  0  0  0  0  0  0  1  0  0  0  0  0  0  0  0  0  0  0  0  0  0 
 > pw :0,36

## ITERATION 254 #######################


> Neighbours evaluated; 255
> Selected Move:	5160	3	3	15	24700


> New Y[]: 
	
	 2  0  0  0  1  0  0  0  0  0  0  3  0  0  0  1  0  0  0  0  0  0  0  0  0  1  0  0  0  0  0  0  1  0  0  0  0  0  0  1 


> New S[]: 
	
	 0  0  0  0  0  0  0  0  0  0  0  1  0  0  0  1  0  0  0  0  0  0  0  0  0  1  0  0  0  0  0  0  0  0  0  0  0  0  0  0 
 > pw :0,355

## ITERATION 255 #######################


> Neighbours evaluated; 260
> Selected Move:	5160	4	11	15	24400


> New Y[]: 
	
	 2  0  0  0  1  0  0  0  0  0  0  1  0  0  0  3  0  0  0  0  0  0  0  0  0  1  0  0  0  0  0  0  1  0  0  0  0  0  0  1 


> New S[]: 
	
	 0  0  0  0  0  0  0  0  0  0  0  1  0  0  0  1  0  0  0  0  0  0  0  0  0  1  0  0  0  0  0  0  0  0  0  0  0  0  0  0 
 > pw :0,35

## ITERATION 256 #######################


> Neighbours evaluated; 262
> Selected Move:	5160	3	11	13	22900


> New Y[]: 
	
	 2  0  0  0  1  0  0  0  0  0  0  0  0  1  0  3  0  0  0  0  0  0  0  0  0  1  0  0  0  0  0  0  1  0  0  0  0  0  0  1 


> New S[]: 
	
	 0  0  0  0  0  0  0  0  0  0  0  0  0  1  0  1  0  0  0  0  0  0  0  0  0  1  0  0  0  0  0  0  0  0  0  0  0  0  0  0 
 > pw :0,345

## ITERATION 257 #######################


> Neighbours evaluated; 264
> Selected Move:	5280	3	39	7	24900


> New Y[]: 
	
	 2  0  0  0  1  0  0  1  0  0  0  0  0  1  0  3  0  0  0  0  0  0  0  0  0  1  0  0  0  0  0  0  1  0  0  0  0  0  0  0 


> New S[]: 
	
	 0  0  0  0  0  0  0  0  0  0  0  0  0  1  0  0  0  0  0  0  0  0  0  0  0  1  0  0  0  0  0  0  1  0  0  0  0  0  0  0 
 > pw :0,34

## ITERATION 258 #######################


> Neighbours evaluated; 197
> Selected Move:	5290	3	15	3	24500


> New Y[]: 
	
	 2  0  0  3  1  0  0  1  0  0  0  0  0  1  0  0  0  0  0  0  0  0  0  0  0  1  0  0  0  0  0  0  1  0  0  0  0  0  0  0 


> New S[]: 
	
	 0  0  0  0  0  0  0  0  0  0  0  0  0  1  0  0  0  0  0  0  0  0  0  0  0  1  0  0  0  0  0  0  1  0  0  0  0  0  0  0 
 > pw :0,335

## ITERATION 259 #######################


> Neighbours evaluated; 146
> Selected Move:	5290	4	3	7	24400


> New Y[]: 
	
	 2  0  0  1  1  0  0  3  0  0  0  0  0  1  0  0  0  0  0  0  0  0  0  0  0  1  0  0  0  0  0  0  1  0  0  0  0  0  0  0 


> New S[]: 
	
	 0  0  0  0  0  0  0  0  0  0  0  0  0  1  0  0  0  0  0  0  0  0  0  0  0  1  0  0  0  0  0  0  1  0  0  0  0  0  0  0 
 > pw :0,33

## ITERATION 260 #######################


> Neighbours evaluated; 152
> Selected Move:	5290	3	13	28	24900


> New Y[]: 
	
	 2  0  0  1  1  0  0  3  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  1  0  0  1  0  0  0  1  0  0  0  0  0  0  0 


> New S[]: 
	
	 0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  1  0  0  1  0  0  0  1  0  0  0  0  0  0  0 
 > pw :0,325

## ITERATION 261 #######################


> Neighbours evaluated; 130
> Selected Move:	5290	4	7	3	25000


> New Y[]: 
	
	 2  0  0  3  1  0  0  1  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  1  0  0  1  0  0  0  1  0  0  0  0  0  0  0 


> New S[]: 
	
	 0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  1  0  0  1  0  0  0  1  0  0  0  0  0  0  0 
 > pw :0,32

## ITERATION 262 #######################


> Neighbours evaluated; 139
> Selected Move:	5290	3	25	13	24500


> New Y[]: 
	
	 2  0  0  3  1  0  0  1  0  0  0  0  0  1  0  0  0  0  0  0  0  0  0  0  0  0  0  0  1  0  0  0  1  0  0  0  0  0  0  0 


> New S[]: 
	
	 0  0  0  0  0  0  0  0  0  0  0  0  0  1  0  0  0  0  0  0  0  0  0  0  0  0  0  0  1  0  0  0  1  0  0  0  0  0  0  0 
 > pw :0,315

## ITERATION 263 #######################


> Neighbours evaluated; 147
> Selected Move:	5290	4	3	7	24400


> New Y[]: 
	
	 2  0  0  1  1  0  0  3  0  0  0  0  0  1  0  0  0  0  0  0  0  0  0  0  0  0  0  0  1  0  0  0  1  0  0  0  0  0  0  0 


> New S[]: 
	
	 0  0  0  0  0  0  0  0  0  0  0  0  0  1  0  0  0  0  0  0  0  0  0  0  0  0  0  0  1  0  0  0  1  0  0  0  0  0  0  0 
 > pw :0,31

## ITERATION 264 #######################


> Neighbours evaluated; 176
> Selected Move:	5210	3	32	21	24900


> New Y[]: 
	
	 2  0  0  1  1  0  0  3  0  0  0  0  0  1  0  0  0  0  0  0  0  1  0  0  0  0  0  0  1  0  0  0  0  0  0  0  0  0  0  0 


> New S[]: 
	
	 1  0  0  0  1  0  0  1  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0 
 > pw :0,305

## ITERATION 265 #######################


> Neighbours evaluated; 156
> Selected Move:	5280	3	28	25	24900


> New Y[]: 
	
	 2  0  0  1  1  0  0  3  0  0  0  0  0  1  0  0  0  0  0  0  0  1  0  0  0  1  0  0  0  0  0  0  0  0  0  0  0  0  0  0 


> New S[]: 
	
	 1  0  0  0  1  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  1  0  0  0  0  0  0  0  0  0  0  0  0  0  0 
 > pw :0,3

## ITERATION 266 #######################


> Neighbours evaluated; 143
> Selected Move:	5380	3	7	24	24200


> New Y[]: 
	
	 2  0  0  1  1  0  0  0  0  0  0  0  0  1  0  0  0  0  0  0  0  1  0  0  3  1  0  0  0  0  0  0  0  0  0  0  0  0  0  0 


> New S[]: 
	
	 0  0  0  1  0  0  0  0  0  0  0  0  0  1  0  0  0  0  0  0  0  1  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0 
 > pw :0,295

## ITERATION 267 #######################


> Neighbours evaluated; 247
> Selected Move:	5380	3	24	31	24300


> New Y[]: 
	
	 2  0  0  1  1  0  0  0  0  0  0  0  0  1  0  0  0  0  0  0  0  1  0  0  0  1  0  0  0  0  0  3  0  0  0  0  0  0  0  0 


> New S[]: 
	
	 0  0  0  1  0  0  0  0  0  0  0  0  0  1  0  0  0  0  0  0  0  1  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0 
 > pw :0,29

## ITERATION 268 #######################


> Neighbours evaluated; 239
> Selected Move:	5380	4	31	3	24500


> New Y[]: 
	
	 2  0  0  3  1  0  0  0  0  0  0  0  0  1  0  0  0  0  0  0  0  1  0  0  0  1  0  0  0  0  0  1  0  0  0  0  0  0  0  0 


> New S[]: 
	
	 0  0  0  1  0  0  0  0  0  0  0  0  0  1  0  0  0  0  0  0  0  1  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0 
 > pw :0,285

## ITERATION 269 #######################


> Neighbours evaluated; 245
> Selected Move:	5340	3	13	28	25000


> New Y[]: 
	
	 2  0  0  3  1  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  1  0  0  0  1  0  0  1  0  0  1  0  0  0  0  0  0  0  0 


> New S[]: 
	
	 1  0  0  1  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  1  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0 
 > pw :0,28

## ITERATION 270 #######################


> Neighbours evaluated; 222
> Selected Move:	5360	3	31	24	25000


> New Y[]: 
	
	 2  0  0  3  1  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  1  0  0  1  1  0  0  1  0  0  0  0  0  0  0  0  0  0  0 


> New S[]: 
	
	 1  0  0  0  1  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  1  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0 
 > pw :0,275

## ITERATION 271 #######################


> Neighbours evaluated; 196
> Selected Move:	5360	4	3	24	24700


> New Y[]: 
	
	 2  0  0  1  1  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  1  0  0  3  1  0  0  1  0  0  0  0  0  0  0  0  0  0  0 


> New S[]: 
	
	 1  0  0  0  1  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  1  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0 
 > pw :0,27

## ITERATION 272 #######################


> Neighbours evaluated; 212
> Selected Move:	5360	3	24	10	24600


> New Y[]: 
	
	 2  0  0  1  1  0  0  0  0  0  3  0  0  0  0  0  0  0  0  0  0  1  0  0  0  1  0  0  1  0  0  0  0  0  0  0  0  0  0  0 


> New S[]: 
	
	 1  0  0  0  1  0  0  0  0  0  1  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0 
 > pw :0,265

## ITERATION 273 #######################


> Neighbours evaluated; 155
> Selected Move:	5340	3	10	31	24800


> New Y[]: 
	
	 2  0  0  1  1  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  1  0  0  0  1  0  0  1  0  0  3  0  0  0  0  0  0  0  0 


> New S[]: 
	
	 1  0  0  1  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  1  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0 
 > pw :0,26

## ITERATION 274 #######################


> Neighbours evaluated; 237
> Selected Move:	5242	3	4	39	25300


> New Y[]: 
	
	 2  0  0  1  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  1  0  0  0  1  0  0  1  0  0  3  0  0  0  0  0  0  0  1 


> New S[]: 
	
	 1  0  0  1  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  1  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0 
 > pw :0,255

## ITERATION 275 #######################


> Neighbours evaluated; 240
> Selected Move:	5309	3	31	24	25200


> New Y[]: 
	
	 2  0  0  1  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  1  0  0  3  1  0  0  1  0  0  0  0  0  0  0  0  0  0  1 


> New S[]: 
	
	 1  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  1  0  0  0  0  0  0  0  0  0  0  0  0  0  0  1 
 > pw :0,25

## ITERATION 276 #######################


> Neighbours evaluated; 245
> Selected Move:	5285	3	24	10	25100


> New Y[]: 
	
	 2  0  0  1  0  0  0  0  0  0  3  0  0  0  0  0  0  0  0  0  0  1  0  0  0  1  0  0  1  0  0  0  0  0  0  0  0  0  0  1 


> New S[]: 
	
	 0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  1  0  0  0  1  0  0  1  0  0  0  0  0  0  0  0  0  0  0 
 > pw :0,245

## ITERATION 277 #######################


> Neighbours evaluated; 231
> Selected Move:	5213	3	10	16	25600


> New Y[]: 
	
	 2  0  0  1  0  0  0  0  0  0  0  0  0  0  0  0  3  0  0  0  0  1  0  0  0  1  0  0  1  0  0  0  0  0  0  0  0  0  0  1 


> New S[]: 
	
	 1  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  1  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  1 
 > pw :0,24

## ITERATION 278 #######################


> Neighbours evaluated; 218
> Selected Move:	5240	4	16	3	25500


> New Y[]: 
	
	 2  0  0  3  0  0  0  0  0  0  0  0  0  0  0  0  1  0  0  0  0  1  0  0  0  1  0  0  1  0  0  0  0  0  0  0  0  0  0  1 


> New S[]: 
	
	 1  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  1  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  1 
 > pw :0,245

## ITERATION 279 #######################


> Neighbours evaluated; 227
> Selected Move:	5238	3	16	24	25500


> New Y[]: 
	
	 2  0  0  3  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  1  0  0  1  1  0  0  1  0  0  0  0  0  0  0  0  0  0  1 


> New S[]: 
	
	 1  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  1  0  0  0  0  0  0  0  0  0  0  0  0  0  0  1 
 > pw :0,25

## ITERATION 280 #######################


> Neighbours evaluated; 250
> Selected Move:	5210	3	25	13	25000


> New Y[]: 
	
	 2  0  0  3  0  0  0  0  0  0  0  0  0  1  0  0  0  0  0  0  0  1  0  0  1  0  0  0  1  0  0  0  0  0  0  0  0  0  0  1 


> New S[]: 
	
	 1  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  1  0  0  0  0  0  0  0  0  0  0  0  0  0  0  1 
 > pw :0,255

## ITERATION 281 #######################


> Neighbours evaluated; 249
> Selected Move:	5210	4	3	24	24700


> New Y[]: 
	
	 2  0  0  1  0  0  0  0  0  0  0  0  0  1  0  0  0  0  0  0  0  1  0  0  3  0  0  0  1  0  0  0  0  0  0  0  0  0  0  1 


> New S[]: 
	
	 1  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  1  0  0  0  0  0  0  0  0  0  0  0  0  0  0  1 
 > pw :0,26

## ITERATION 282 #######################


> Neighbours evaluated; 252
> Selected Move:	5210	3	24	1	23000


> New Y[]: 
	
	 2  3  0  1  0  0  0  0  0  0  0  0  0  1  0  0  0  0  0  0  0  1  0  0  0  0  0  0  1  0  0  0  0  0  0  0  0  0  0  1 


> New S[]: 
	
	 1  1  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  1 
 > pw :0,265

## ITERATION 283 #######################


> Neighbours evaluated; 270
> Selected Move:	5280	3	13	17	25000


> New Y[]: 
	
	 2  3  0  1  0  0  0  0  0  0  0  0  0  0  0  0  0  1  0  0  0  1  0  0  0  0  0  0  1  0  0  0  0  0  0  0  0  0  0  1 


> New S[]: 
	
	 1  1  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  1 
 > pw :0,27

## ITERATION 284 #######################


> Neighbours evaluated; 259
> Selected Move:	5240	3	21	32	24500


> New Y[]: 
	
	 2  3  0  1  0  0  0  0  0  0  0  0  0  0  0  0  0  1  0  0  0  0  0  0  0  0  0  0  1  0  0  0  1  0  0  0  0  0  0  1 


> New S[]: 
	
	 1  1  0  1  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0 
 > pw :0,275

## ITERATION 285 #######################


> Neighbours evaluated; 259
> Selected Move:	5420	3	28	25	24500


> New Y[]: 
	
	 2  3  0  1  0  0  0  0  0  0  0  0  0  0  0  0  0  1  0  0  0  0  0  0  0  1  0  0  0  0  0  0  1  0  0  0  0  0  0  1 


> New S[]: 
	
	 0  0  0  1  0  0  0  0  0  0  0  0  0  0  0  0  0  1  0  0  0  0  0  0  0  1  0  0  0  0  0  0  0  0  0  0  0  0  0  0 
 > pw :0,27
________________________________________________________________

Best solution found: 5680
Run Termination time: 05.02.2010 01:07:23
Run duration: 00:27:27.0156250
________________________________________________________________
